Concepttree traversal

Tree Traversal

In computer science, an algorithm for visiting every node of a tree-shaped structure. Common approaches include depth-first search and breadth-first search. In specification diffing, tree traversal is used to recursively compare the nodes of abstract syntax trees.

Timeline (last 90 days)

Oct 18

Tree traversal is an algorithm for visiting every node of a tree structure, and common approaches include depth-first search (DFS) and breadth-first search (BFS).

Unverified50%

All Facts (1)

Unverified

Tree traversal is an algorithm for visiting every node of a tree structure, and common approaches include depth-first search (DFS) and breadth-first search (BFS).

50%

Source Articles

OpenAPI Diff Tool: Compatibility Is a Negotiated Fiction Between YAML FilesOct 18