31.9k views
4 votes
Draw an example of a binary tree that:

1. Is a Max Tree, but not a Max Heap,
2. Is a Max Heap and also a Min Heap,
3. Is a Search Tree and a Max Tree and has at least 3 nodes
4. Is a Search Tree and a Min Heap and has at least 3 nodes

User Rob Willis
by
9.2k points

1 Answer

4 votes

Answer:

I hope it will help you!

Step-by-step explanation:

Draw an example of a binary tree that: 1. Is a Max Tree, but not a Max Heap, 2. Is-example-1
Draw an example of a binary tree that: 1. Is a Max Tree, but not a Max Heap, 2. Is-example-2
Draw an example of a binary tree that: 1. Is a Max Tree, but not a Max Heap, 2. Is-example-3
User Tomtaylor
by
8.4k points