Consider various implementations of a binary tree. Which of the

following is FALSE?

An array implementation uses less memory if the tree is fully filled

A linked implementation uses less memory if the tree is fully filled

For an array implementation, it is possible to calculate any node's parent

For a linked implementation, it is possible to find any node's immediate children