Question: BINARY TREE TOPIC 1. Suppose a binary tree T is implemented using a array S, as described in Sec- tion 5.3.1. If n items are
BINARY TREE TOPIC
1. Suppose a binary tree T is implemented using a array S, as described in Sec- tion 5.3.1. If n items are stored in S in sorted order, starting with index 1, is the tree T a heap?
2. Is there a heap T storing seven distinct elements such that a preorder traversal of T yields the elements of T in sorted order? How about an inorder traversal? How about a postorder traversal?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
