How to make a directory tree from an array of paths?

Question

Python

There is an array of type string mas = [
E:/folder/maps
E:/1/2/3
E:/folder/new
E:/folder/maps/2
D:/papka/echepapka
E:/1/path/dir
]
What algorithm to bypass this array to get the hierarchy of all folders?
Preferably in python

Answer 1

For example, you can add to a dictionary:

from functools import reduce
from pathlib import PurePosixPath

paths = [
    'E:/folder/maps',
    'E:/1/2/3',
    'E:/folder/new',
    'E:/folder/maps/2',
    'D:/papka/echepapka',
    'E:/1/path/dir',
]

tree = {}
for path in map(PurePosixPath, paths):
    reduce(lambda node, part: node.setdefault(part, {}), path.parts, tree)

Result:

{'E:': {'folder': {'maps': {'2': {}}, 'new': {}},
  '1': {'2': {'3': {}}, 'path': {'dir': {}}}},
 'D:': {'papka': {'echepapka': {}}}}

Answer 2

https://docs.python.org/3/library/os.html#os.walk

Answer 3

Yes, it seems that a cunning algorithm is not needed here. Take the next line, break it into separate tokens.
Further in the token loop, you try to find a partial path, and if it doesn’t work, add it to the tree.
For example, you added the first 2 paths:

E
|-1
| |-2
|   |-3
|-folder
  |-maps

Add "E:/folder/new" This is a set of tokens ["E:", "folder", "new"]. E: is in our tree, go to this subtree.
folder is there again. new is not found, add it.