Tree Traversal for UI Hierarchy | Dataford Interview Questions

Given a binary tree, write an algorithm to traverse it and find specific nodes representing hierarchical UI elements.

Use def find_ui_nodes(tree, targets):. Represent each node as [value, left, right], with None for a missing child. Return every root-to-node path whose value appears in targets, in preorder traversal order. Include duplicate matching values when they occur at different nodes.

Constraints

The tree is either None or a nested node represented as [value, left, right].
Each node value is a string.
0 <= number of nodes <= 10^4
0 <= len(targets) <= 10^4
Every returned path starts at the root and ends at a matching node.
Return matching nodes in preorder traversal order.

Function Signature

def find_ui_nodes(tree, targets):

Your question is Tree Traversal for UI Hierarchy. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given a binary tree, write an algorithm to traverse it and find specific nodes representing hierarchical UI elements.

Constraints

The tree is either None or a nested node represented as [value, left, right].
Each node value is a string.
0 <= number of nodes <= 10^4
0 <= len(targets) <= 10^4
Every returned path starts at the root and ends at a matching node.
Return matching nodes in preorder traversal order.

Function Signature

def find_ui_nodes(tree, targets):

Your question is Tree Traversal for UI Hierarchy. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.