The tree pointer is the first node of the binary tree and has both data and two reference links.   True False

Assume that a node is at position 12 in an array representation of a binary tree. Give the positions of that node's parent, left child, and right child.

A complete binary tree is stored in an array called treeNodes, which is indexed from 0 to 99. The tree contains 85 elements

/*LCA of Binary TreeSend FeedbackGiven a binary tree and data of two nodes, find 'LCA' (Lowest Common Ancestor) of the given two nodes in the binary tree.LCALCA of two nodes A and B is the lowest or deepest node which has both A and B as its descendants. Example: In this example, the green coloured node is the LCA to A and B.Alt TextNote:It is defined that each node is a descendant to itself, so, if there are two nodes X and Y and X has a direct connection from Y, then Y is the lowest common ancestor. Example:Alt TextNote: 1. If out of 2 nodes only one node is present, return that node. 2. If both are not present, return -1.Input format: The first line of input contains data of the nodes of the tree in level order form. The data of the nodes of the tree is separated by space. If any node does not have left or right child, take -1 in its place. Since -1 is used as an indication whether the left or right nodes exist, therefore, it will not be a part of the data of any node. The following…