Traverse the tree and tally: use the traverse function with a callback that increments a files counter for file nodes and a folders counter for folder nodes. Return both counts.
File Explorer Tree Data Structure in JavaScript
How do you count files and folders in a file tree?
The answer
More FAQs in File Explorer Tree Data Structure in JavaScript
Each node is an object with name, type ('file' or 'folder'), and children (array of child nodes, only for folders). Files have no children. Folders can have nested folders and files. This creates a nested tree structure.
Use recursive DFS (depth-first search): function traverse(node, callback, depth) { callback(node, depth); if (node.children) node.children.forEach(child => traverse(child, callback, depth + 1)); }. This visits every node in the tree.
Recursively search: if the current node's name matches, return it. Otherwise, recurse into children. Return null if not found. This is a DFS search through the tree.
Still have questions?
Browse all our FAQs or reach out to our support team
Want to upskill yourself?
Your learning library
Small steps. Big possibilities.
Find your next course. Build something great.