@sharad :we need to check at each intermediate level there are 2^n nodes so do a bfs...also perfom the count of left subtree and right subtree where count(left subtree)>count(right subtree))....
On Tue, Jun 29, 2010 at 11:34 PM, sharad kumar <sharad20073...@gmail.com>wrote: > A *complete binary tree* is a binary tree in which every level, *except > possibly the last*, is completely filled, and all nodes are as far left as > possible > write a code which check whether a given tree is complete or not > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- yezhu malai vaasa venkataramana Govinda Govinda -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
