-
Notifications
You must be signed in to change notification settings - Fork 2
/
DiameterOfBinaryTree.py
53 lines (44 loc) · 994 Bytes
/
DiameterOfBinaryTree.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
# Definition for a binary tree node.
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
def diameterOfBinaryTree(self, root: TreeNode) -> int:
self.result = 0
def dfs(node: TreeNode):
if not node: return 0
L = dfs(node.left)
R = dfs(node.right)
self.result = max(self.result, L+R)
return max(L, R) + 1
dfs(root)
return self.result
########
# Test #
########
# 1
# / \
# 2 3
# / \
# 4 5
# / \ \
# 6 7 8
root = TreeNode(1)
node1 = TreeNode(2)
node2 = TreeNode(3)
node3 = TreeNode(4)
node4 = TreeNode(5)
node5 = TreeNode(6)
node6 = TreeNode(7)
node7 = TreeNode(8)
root.left = node1
root.right = node2
node1.left = node3
node1.right = node4
node3.left = node5
node3.right = node6
node4.right = node7
assert Solution().diameterOfBinaryTree(root) == 4
print("OH, YEAH!")