dixon5702 dixon5702 16-05-2023 Business contestada In an array-based implementation of a binary tree, the data member free is the index of the index of the first node in the free list. Therefore the next available node will always be at index free + 1. True or false?
