Function
traversal
(node, {inorder, postorder})
Source from the content-addressed store, hash-verified
| 508 | let i = 0; |
| 509 | |
| 510 | function traversal(node, {inorder, postorder}) { |
| 511 | inorder?.(node); |
| 512 | if (node != null) { |
| 513 | for (let child of node.children ?? []) { |
| 514 | traversal(child, {inorder, postorder}); |
| 515 | postorder?.(child); |
| 516 | } |
| 517 | } |
| 518 | } |
| 519 | |
| 520 | function inorder(child) { |
| 521 | // in-order so we add items as we encounter them in the tree, then we can insert them in expected order later |
Tested by
no test coverage detected