code: def mknode(self, al_branchNodes):
              
              b_ret = True
              # First check that none of these nodes already exist in the tree
              l_branchNodes = []
              for node in al_branchNodes:
                  l_path      = self.l_cwd[:]
                  l_path.append(node)
                  #print l_path
                  #print self.ml_allPaths
                  #print self.b_pathOK(l_path)
                  if not self.b_pathOK(l_path):
                      l_branchNodes.append(node)
              if not len(l_branchNodes):
                  return False
              snodeBranch   = C_snodeBranch(l_branchNodes)
              for node in l_branchNodes:
                  depth = self.snode_current.depth()
                  # if (self.msnode_current != self.msnode_root):
                  snodeBranch.dict_branch[node].depth(depth+1)
                  snodeBranch.dict_branch[node].snode_parent = self.snode_current
              self.snode_current.node_dictBranch(snodeBranch.dict_branch)
              # Update the ml_allPaths
              self.paths_update(al_branchNodes)
              return b_ret
docs: Create a set of nodes (branches) at current node. Analogous to
              a UNIX mkdir call, however nodes can be any type (i.e. not
              just "directories" but also "files")