MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / diameterOfTree

Function diameterOfTree

javascript/0543-diameter-of-binary-tree.js:13–18  ·  view source on GitHub ↗
(root, max)

Source from the content-addressed store, hash-verified

11};
12
13const diameterOfTree = (root, max) => {
14 const isBaseCase = root === null;
15 if (isBaseCase) return 0;
16
17 return dfs(root, max);
18};
19
20const dfs = (root, max) => {
21 const left = diameterOfTree(root.left, max);

Callers 2

diameterOfBinaryTreeFunction · 0.85
dfsFunction · 0.85

Calls 1

dfsFunction · 0.70

Tested by

no test coverage detected