In C++:

The array below is the level order traversal of a binary tree. Note that -1 represents a null node (absence of a child). Array:{65,40,70,20,50,-1,90,10,-1,45,58.-1,-1,-1,100,-1,45,42,47,-1,60} A. (30 points) Write a program to create a binary tree from the leaf node (bottom up) to the root using the array. You are to keep references (pointers) to parent node, left child, and right child nodes B. (20 points) From the tree created from Q3A, generate a bottom-up level order traversal of its nodes' data (i.e., from right to left, level by level from leaf to root). What is the time complexity