Python program to find diameter of binary tree in O(n).














































Python program to find diameter of binary tree in O(n).



Description :

Diameter of binary tree is length of longest path between any two nodes in a tree.
This path may or may not pass through the root. The diameter of binary tree can be
calculated using only height function, because the diameter of binary tree is nothing
but the maximum value of (left_height+right_height+1)for each node.
So we need to calculate this value.

Program:

class newNode: def __init__(self, data): self.data = data self.left = self.right = None def height(root, result): if (root == None): return 0 left_height = height(root.left, result) right_height = height(root.right, result) # update the answer, because diameter # of a tree is nothing but maximum # value of (left_height + right_height + 1) # for each node result[0] = max(result[0], 1 + left_height + right_height) return 1 + max(left_height, right_height) # Computes the diameter of binary # tree with given root. def diameter(root): if (root == None): return 0 result = [-999999999999] # This will store # the final answer height_of_tree = height(root, result) return result[0] if __name__ == '__main__': root = newNode(1) root.left = newNode(2) root.right = newNode(3) root.left.left = newNode(4) root.left.right = newNode(5) print("Diameter is", diameter(root))



Output:
>>>
Diameter is 4
>>>

More Articles of Khushboo Singh:

Name Views Likes
Python program to insert an element in binary tree. 820 20
Tokenize text using NLTK in Python. 1198 12
Python Remove multiple elements from list while Iterating. 730 22
Python How to Check if an item exists in list ? 4267 14
Python How to remove multiple elements from list ? 736 26
Python program to check if two trees are mirror of each other without using recursion. 659 19
Python program to find maximum in Binary tree. 928 19
Python Check if all elements are same using Set 708 15
Python program to find diameter of a binary tree. 1081 20
Python program to print root to leaf paths without using recursion. 839 20
Python program to find root of the tree where children id sum for every node is given. 668 23
Introduction of Python NLTK library 1354 25
Categorizing and Tagging Sentences using NLTK in Python . 999 19
Python program to find height of a tree without using recursion. 661 16
Python program to find sum of all nodes of the given perfect binary tree. 655 19
Python program to find minimum in binary tree. 820 23
Python Check if element exist in list using list.count() function. 690 13
Python program to convert a given binary tree to doubly linked list. 882 20
Python program to find distance between two nodes of a binary tree. 1521 20
NLTK stop Words 1134 13
Python program to find largest binary search tree in a Binary Tree. 933 20
Python program to find inorder successor in binary search tree with recursion. 1201 18
Python program to convert a binary tree into doubly linked list in spiral fashion. 794 15
Python List check if element are same using all() 666 12
Python program to check if two trees are identical using recursion. 705 30
Python Find the occurrence count of an element in the tuple using count() 964 23
Python Convert two lists to a dictionary 722 19
Python program to construct a complete binary tree from given array. 1426 14
Python program to find diameter of binary tree in O(n). 870 17
Introduction to the AVL tree. 739 15
Python program to check if two trees are identical without using recursion 659 17
Python Convert a list of tuples to dictionary. 1076 24
Python program to convert a binary tree to a circular doubly link list. 644 21
Python Check if element exist in list based on own logic. 736 23
Python program to merge two binary trees by doing node sum using recursion 999 27
Python program to check whether a given binary tree is perfect or not. 674 17
Python Check if all elements are same using list.count(). 1083 28
Python program to find an element into binary tree 627 12
Python program to find lowest common ancestor in a binary tree 1209 24

Comments