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

View previous topic View next topic Go down

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

Post  Admin on Sun Jan 31, 2010 7:24 am

(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.

Admin
Admin

Posts : 71
Join date : 2010-01-21

View user profile http://campus-interview.co.cc

Back to top Go down

View previous topic View next topic Back to top

- Similar topics

 
Permissions in this forum:
You cannot reply to topics in this forum