MCPcopy
hub / github.com/TheAlgorithms/JavaScript / output

Function output

Data-Structures/Tree/test/BinarySearchTree.test.js:25–25  ·  view source on GitHub ↗
(val)

Source from the content-addressed store, hash-verified

23 test('should perform in-order traversal', () => {
24 const values = []
25 const output = (val) => values.push(val)
26 tree.traverse(output)
27 expect(values).toEqual([3, 5, 8, 10, 15])
28 })

Callers 15

printCalMethod · 0.85
printBoardMethod · 0.85
printBoardMethod · 0.85
printBoardMethod · 0.85
SearchArrayFunction · 0.85
ExampleIntervalTimerFunction · 0.85
printMethod · 0.85
printGraphMethod · 0.85
bfsMethod · 0.85
dfsMethod · 0.85
printGraphMethod · 0.85
printDataMethod · 0.85

Calls 1

pushMethod · 0.45

Tested by

no test coverage detected