Benchmark: Tree Traversals (update 1)

Script Preparation code:

root = {val: 1001}
let i = 0, node = root
while (++i < 1000) {
  while (node) {
    if (i < node.val) {
      if (!node.left) {
        node.left = { val: i }
        break
      }
      node = node.left
    } else {
      if (!node.right) {
        node.right = { val: i }
        break
      }
      node = node.right
    }
  }
}

Tests:

DFS
function dfs(node) { if (!node) return dfs(node.left) dfs(node.right) } dfs(root)
BFS (shift)
let q = [root] while (q.length) { const node = q.shift() if (node.left) q.push(node.left) if (node.right) q.push(node.right) }
BFS (pop)
let q = [root] while (q.length) { const node = q.pop() if (node.right) q.push(node.right) if (node.left) q.push(node.left) }
BFS (reassign queue)
let q = [root] while (q.length) { const level = [] const node = q.shift() if (node.left) level.push(node.left) if (node.right) level.push(node.right) q = level }
BFS (reassign node, shift)
let q = [], node = root while (node) { if (node.left) q.push(node.left) if (node.right) q.push(node.right) node = q.shift() }
BFS (reassign node, pop)
let q = [], node = root while (node) { if (node.right) q.push(node.right) if (node.left) q.push(node.left) node = q.pop() }

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
DFS
BFS (shift)
BFS (pop)
BFS (reassign queue)
BFS (reassign node, shift)
BFS (reassign node, pop)

Fastest: N/A

Slowest: N/A

ⓘ Get performance results from real users on your website with Request Metrics.

Website Performance Monitoring by Request Metrics

Latest run results:

Run details: (Test run date: one year ago)

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/605.1.15 (KHTML, like Gecko) Version/15.6 Safari/605.1.15

Browser/OS: Safari 15 on Mac OS X 10.15.7

View result in a separate tab

Test name	Executions per second
DFS	126442.2 Ops/sec
BFS (shift)	52516.6 Ops/sec
BFS (pop)	230754.9 Ops/sec
BFS (reassign queue)	33766.8 Ops/sec
BFS (reassign node, shift)	52993.2 Ops/sec
BFS (reassign node, pop)	232194.8 Ops/sec

Tree Traversals (update 1) (version: 0)

Comparing performance of: DFS vs BFS (shift) vs BFS (pop) vs BFS (reassign queue) vs BFS (reassign node, shift) vs BFS (reassign node, pop)

Created: one year ago by: Guest

Jump to the latest result

DFS

BFS (shift)

BFS (pop)

BFS (reassign queue)

BFS (reassign node, shift)

BFS (reassign node, pop)

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A