Please help, some of these questions are a littel tricky.

True or False 43. A full binary tree has all the leaf nodes on the same level, and every nonleaf node has two children False 44. A heap is not built using pointer variables. 45. A heap must be a full binary tree True 46. There are only two general ways of representing a graph: adjacency matrix and adjacency lists 47. The implicit representation of a set uses a bit vector. 48. The explicit and implicit representations of a set uses the list ADT. 49. The explicit representation of a set uses a bit vector 50. The explicit representation of a set uses the list ADT 51. The Big-O complexity of implicitly represented binary set operations is the same for SortedList and UnsortedList. 52. Set operations using the explicit representation use Boolean operations