We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4c8e6aa commit 7d7368fCopy full SHA for 7d7368f
1 file changed
Trees/DiameterOfBinaryTree.js
@@ -7,21 +7,21 @@
7
* @see {@link https://en.wikipedia.org/wiki/Tree_(graph_theory)#Properties}
8
*/
9
export function diameterOfBinaryTree(root) {
10
- let diameter = 0;
+ let diameter = 0
11
12
function height(node) {
13
if (node === null) {
14
- return 0;
+ return 0
15
}
16
17
- const leftHeight = height(node.left);
18
- const rightHeight = height(node.right);
+ const leftHeight = height(node.left)
+ const rightHeight = height(node.right)
19
20
- diameter = Math.max(diameter, leftHeight + rightHeight);
+ diameter = Math.max(diameter, leftHeight + rightHeight)
21
22
- return 1 + Math.max(leftHeight, rightHeight);
+ return 1 + Math.max(leftHeight, rightHeight)
23
24
25
- height(root);
26
- return diameter;
+ height(root)
+ return diameter
27
0 commit comments