Question: It is possible to create a binary tree containing 1 or 2 nodes (with different keys in each node) that is both a heap and

It is possible to create a binary tree containing 1 or 2 nodes (with different keys in each node) that is both a heap and a binary search tree. Is this possible for a tree containing 3 nodes? If yes, give an example. If no, explain why this is not possible. (5 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
