Diameter of Binary Tree in Python

Suppose we have a binary tree; we have to compute the length of the diameter of the tree. The diameter of a binary tree is actually the length of the longest path between any two nodes in a tree. This path not necessarily pass through the root. So if the tree is like below, then the diameter will be 3.as the length of the path [4,2,1,3] or [5,2,1,3] is 3

To solve this, we will follow these steps −

  • We will use the dfs to find the diameter, set answer := 0
  • call the dfs function with the root dfs(root)
  • dfs will work like below dfs(node)
  • if node is not present, then return 0
  • left := dfs(left subtree of root), and right := dfs(right subtree of root)
  • answer := max of answer and left + right
  • return max of left + 1 and right + 1


Let us see the following implementation to get better understanding −

class Solution(object):
   def diameterOfBinaryTree(self, root):
      :type root: TreeNode
      :rtype: int
      self.ans = 0
      return self.ans
   def dfs(self, node):
      if not node:
         return 0
      left = self.dfs(node.left)
      right = self.dfs(node.right)
      self.ans =max(self.ans,right+left)
      return max(left+1,right+1)




Published on 16-Jan-2020 11:01:51