1.Create a Tree structure.Each node representing a directory under its
respective parent for first N lines.
2.For M lines ,match the maximum possible path with the mth(m E M)
directory path.Keep adding the nodes and increase the count.
On Thu, Feb 17, 2011 at 6:23 PM, Akshata Sharma
I think we can build a n-ary tree from the n directory paths that are
already available in the computer and then for each of the m directory paths
we can traverse the tree up until the directory which is already available
in the tree and then count the remaining directories in the path.
1
On Unix computers, data is stored in directories. There is one root
directory, and this might have several directories
contained inside of it, each with di fferent names. These directories might
have even more directories contained inside of them,
and so on.
A directory is uniquely identified by
