please answer 36,37 and 38

Trees 34. Explain the following terms: trees, root, descendants, ancestors, leaves, siblings, 35. Given a tree, identify the [root | leaves tree height | tree size]. Given a tree, 36. Explain how to store a binary tree using an [array linked structure]. For an parent, child, depth, node height, tree height, full tree, complete tree, balanced tree. label each node with its [depth | height]. Given a tree, identify if it is [full| complete | balanced]. array, explain how to find the child/parent of a given node based only on the index of that element. For a linked structure, write the code for a node. Can you generalize the idea to k-ary trees? 7. Explain how to represent trees using "first-child next-sibling" approach. Be able to convert between different representations. 38. Write a recursive method to calculate the [size | height] of a tree