Of the following tree structure, which is, efficient considering space and time complexities?

2

(a)   Incomplete Binary Tree

(b)   Complete Binary Tree     

(c)    Full Binary Tree

            (b) Complete Binary Tree.

By the method of elimination:

Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it.