Draw all binary trees of height 1 featuring elements in A= (7, 9, 8). Indicate whether they are binary search trees, max binary heaps, min binary heaps, or none of these. Justify your answer with the properties of each classification.