A **full binary tree** (sometimes proper **binary tree** or 2-**tree**) is a **tree** in which every node other than the leaves has two children.

Program:

class Node: def __init__(self,key): self.left = None self.right = None self.val = key def inorder(root): if root: inorder(root.left) print(root.val,end=" ") inorder(root.right) def Full(root): if root is None: return True if root.left is None and root.right is None: return True if root.left is not None and root.right is not None: return (Full(root.left) and Full(root.right)) return False if __name__ == '__main__': Root = Node(100) Root.left = Node(200) Root.right = Node(300) Root.left.right = Node(400) Root.left.left = Node(500) Root.right.left = Node(600) Root.right.right = Node(700) print('\nInorder Traversal of BT is:') inorder(Root) print("\n") if Full(Root): print('Given Binary tree is a Full Binary Tree') else: print('Given Binary tree is not a Full Binary Tree') else: passOutput :

D:\JB>python 1.pyInorder Traversal of BT is:500 200 400 100 600 300 700Given Binary tree is a Full Binary Tree

## Comments