Monday 29 June 2015

Q25,p2,d14. A full binary tree with n leaves contains



(A) n nodes (B) log 2n nodes
(C) 2n –1 nodes (D) 2n nodes.

Answer C.

A full binary tree has n-1 non leaves nodes and n leaves. So total 2n-1 nodes.

Posted by at

No comments:

Post a Comment

Note: only a member of this blog may post a comment.

Subscribe to: Post Comments (Atom)