[5.1] Binary Trees in Python

Binary Trees are non-linear data structure where each node can have 0,1 or 2 child nodes. This property of binary trees gives advantage in minimizing time complexity of certain operations.
Height of Binary Tree/Subtree: It is calculated as number of edges from the root node of the binary tree or subtree to the node of the longest path.
Depth of Binary tree is the number of edges from root node of the binary tree to that node where we wish to calculate the depth of.
There are different types of binary trees which is useful in different applications:
1) Degenerate/Pathological Tree: It is familiar to linked list and takes O(n) time to reach the nth node.
2) Balanced Binary Tree: It follows the property that difference of height of left and right subtree should be atmost 1. It applies to all the subtrees as well.
3) Perfect Binary Tree: It is a binary tree which has all the nodes 0 or 2 children nodes.
4) Complete Binary Tree: All the nodes are completely filled except possibly the node on last level.

?Join our community:
Android App(Notes+Videos): https://play.google.com/store/apps/details?id=com.thinkx.thinkx Facebook: https://www.facebook.com/thinkxacademy Twitter: https://www.twitter.com/thinkxacademy Instagram: https://www.instagram.com/thinkxacademy