Construct a Binary Tree by using the array given below. Where index $0$ represents the root node and value $-1$ indicates null. Design an algorithm to construct the binary tree and perform the following operations:

a$)$ Print the Post Order traversal of the tree.

b$)$ Print the level order traversal of the tree.

c$)$ Print the right and left view of the tree.

Input:

Total number of keys: $15$

$1234567-1-1-18-1-1-19$