Thursday, March 18, 2010

Definition of Almost Complete Binary Tree

Almost Complete Binary Tree: An almost complete binary tree of n nodes, for any arbitrary nonnegative integer n, is the binary tree made up of the first n nodes of a canonically labeled full binary

No comments:

Post a Comment