MCPcopy Create free account
hub / github.com/TheAlgorithms/Python / diameter

Method diameter

data_structures/binary_tree/diameter_of_binary_tree.py:35–51  ·  view source on GitHub ↗

>>> root = Node(1) >>> root.diameter() 1 >>> root.left = Node(2) >>> root.diameter() 2 >>> root.left.diameter() 1 >>> root.right = Node(3) >>> root.diameter() 3

(self)

Source from the content-addressed store, hash-verified

33 return max(left_depth, right_depth) + 1
34
35 def diameter(self) -> int:
36 """
37 >>> root = Node(1)
38 >>> root.diameter()
39 1
40 >>> root.left = Node(2)
41 >>> root.diameter()
42 2
43 >>> root.left.diameter()
44 1
45 >>> root.right = Node(3)
46 >>> root.diameter()
47 3
48 """
49 left_depth = self.left.depth() if self.left else 0
50 right_depth = self.right.depth() if self.right else 0
51 return left_depth + right_depth + 1
52
53
54if __name__ == "__main__":

Callers 1

Calls 1

depthMethod · 0.45

Tested by

no test coverage detected