help with pseudo-code with ADT

Expand Post »

hi
can anybody give me the answer of this problem

Que: Use binary tree ADT operations to write a pseudo-code procedure ggc(v,T) to count the number of great grandchildren of a given node v in a proper binary tree T.

thanks

Similar Threads

Designing and Implementing an ADT in C++

laki234

Reputation Points: 7

Solved Threads: 0

Newbie Poster

Offline

10 posts
since Nov 2008

Permalink

Dec 13th, 2008

Re: help with pseudo-code with ADT

> can anybody give me the answer of this problem
No, read the forum rules.

Draw some trees (with and without great grandchildren), and figure out how you would approach the problem.

Salem

Team Colleague

Reputation Points: 5862

Solved Threads: 950

Posting Sage

Offline

7,164 posts
since Dec 2005

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in Computer Science Forum Timeline: Red black trees

Next Thread in Computer Science Forum Timeline: Student Needs Homework Help!

DaniWeb Message

Cancel Changes

User Name
Password