Loading a Directory Structure into an N-Ary Tree

I am developing a Java application to create a backup of multiple directories into another location, in order to do some optimizations I needed to extract some information from the directory tree and keep it in memory. Java I/O provides a nice bidirectional structure (the tree can be traversed either starting from the root or the leaves), but in my backup program I needed additional attributes to each node, and be able to add events. Due to its ability to represent ... Read more