LanX! Quoting wikipedia:

In mathematics, and more specifically in graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.

Of course it can be done in perl! For a sample problem such as given, here's a sample solution. 

#! /usr/bin/perl

chomp ((undef, my @D) = <DATA>);
(my $Q = pop @D) =~ s/ /\\b.+\\b/;

sub xt { grep s/\b(\d+),\1\b/$1/, map qq/$_[0],$_/, @_ }
sub tx { print,exit for grep /^$Q$/, @_; map {xt $_, @_} @_ }

push @D, tx @D for \(@D);

__DATA__
5 6
1 2
2 3
2 4
4 5
1 3
3 5
1 5

[download]

Updates: Fix the /$Q/ test per Loops's suggestion. Add \b-s to s///.

In reply to Re: Tree in perl by oiskuu
in thread Tree in perl by saurabh2k26

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.