code: def initFromDict(self, adict, **kwargs):
              
              # First, flatten the dictionary into a dictionary of paths/files
              a_flat  = C_stree.flatten(adict)
  
              l_dir   = []
              # Now, build a tree from this structure by generating a list of paths
              for k, v in a_flat.items():
                  l_dir.append(k.split('/')[1:-1])
  
              # remove duplicates...
              l_dir = [list(x) for x in set(tuple(x) for x in l_dir)]
  
              # build sorted list of paths...
              l_path  = ['/' + '/'.join(p) for p in l_dir]
              l_path.sort()
  
              # build the tree
              for dir in l_path: self.mkdir(dir)
  
              # and now add the leaves
              for file,contents in a_flat.items(): self.touch(file, contents)
docs: Initialize self from dictionary.
              :param adict:
              :return: