Premium
DOM Tree Walk 1: Collect Text Nodes
Implement collectText(node) that traverses a DOM-like tree and returns all text content (nodeType 3) in document order. Why this matters in real FE work: - This is the core idea behind utilities like textContent, DOM sanitizers, custom renderers, and “walk the tree and extract something”…
What you’ll build / What this tests
This premium javascript coding focuses on DOM Tree Walk 1: Collect Text Nodes. You’ll apply dom and tree thinking with easy level constraints. The prompt emphasizes Implement collectText(node) that traverses a DOM-like tree and returns all text content (nodeType 3) in document….
Learning goals
- Translate the prompt into a clear javascript API signature and return shape.
- Apply dom, tree, recursion techniques to implement dom tree walk 1: collect text nodes.
- Handle easy edge cases without sacrificing readability.
- Reason about time/space complexity and trade-offs in javascript.
Key decisions to discuss
- Define the exact input/output contract before coding.
- Prioritize predictable edge-case handling over micro-optimizations.
Evaluation rubric
- Correctness: covers required behaviors and edge cases.
- Clarity: readable structure and predictable control flow.
- Complexity: avoids unnecessary work for large inputs.
- API discipline: no mutation of inputs; returns expected shape.
- Testability: solution is easy to unit test.
Constraints / Requirements
- Handle empty strings and mixed casing without errors.
- Avoid prototype pitfalls when reading object keys.
- Avoid deep recursion issues on large inputs.
- Do not access the real DOM; use the provided node shape.
- Handle empty or missing inputs without throwing errors.
- Keep runtime close to linear time where possible.
- Prefer a pure function: no side effects beyond the return value.
Mini snippet (usage only)
// Example usage
const node = /* dom tree walk 1: collect text nodes input */;
const result = collectText(node);
console.log(result);
// Edge case check
const empty = node ?? null;
const fallback = collectText(node);
console.log(fallback);
// Expected: describe output shape, not the implementation
// (no solution code in preview)Common pitfalls
- Mutating inputs instead of returning a new value.
- Skipping edge cases like empty input, duplicates, or nulls.
- Overlooking time complexity for large inputs.
Related questions
Upgrade to FrontendAtlas Premium to unlock this challenge. Already upgraded? Sign in to continue.