R 2.7 : Let T be a binary tree with n nodes that is realized with a vector S and let p be the level numbering of the nodes in T, as given in section 2.3.4. Give code descriptions of each of the following methods: root; parent; leftChild; rightChild; isInternal; isExternal; and isRoot.