递归地跟随目录树

Question

So I'm working with Python and still pretty new at it, and I need to be able to traverse all folders within a directory, so if /foo contains /foo/bar and /foo/bar/foo I want to list all entries. So far I've created a class that works inside it's own file but when I try to import it I get an error stating TypeError: coercing to Unicode: need string or buffer, builtin_function_or_method found .

Function is found in the file DirTree so I'm importing it via:

from DirTree import DirTrav

DirList = DirTrav(dir).returnList()

The code can be found below.

import os

class DirTrav:
    DList = []
    dir = ""

    def __init__(self, dirTrav):
        self.dir = dirTrav

    def dirTree(self, start):
        _subFolders = os.listdir(start)
        for f in _subFolders:
            _newFolder = os.path.join(start, f)
            if os.path.isdir( _newFolder):
                self.DList.append(_newFolder)
                self.dirTree(_newFolder)

    def returnList(self):
        self.dirTree(dir)
        return self.DList

Answer 1

Use os.walk() :

for root, dirs, files in os.walk():
    for filename in files:
        # do something with filename (files and will return all files recursively)
        # note f is only filename and not path, use the following (as an example if you wanted to open the file)
        with open(os.path.join(root, filename)) as f:
            for line in f:
                print f
        pass