linux-c-programming.vger.kernel.org archive mirror
 help / color / mirror / Atom feed
From: Joel Pareja <jpareja@ntsp.nec.co.jp>
To: linux-c-programming <linux-c-programming@vger.kernel.org>
Subject: Re: binary tree traversal...
Date: 27 Jan 2005 11:19:13 +0800	[thread overview]
Message-ID: <1106795952.983.26.camel@localhost.localdomain> (raw)
In-Reply-To: <Pine.LNX.4.21.0501262350200.30870-100000@hestia>

[-- Attachment #1: Type: text/plain, Size: 1943 bytes --]

Hi,

It did traverse your binary tree. However, your call to printf is only
performed with the first(?) node.

I think this is how to accomplish what you want.

---- snippet+  ---

{
  ....
  treerecurse(root);   // you don't need a loop here
  ....

}

struct tnode *treerecurse(struct tnode *p) {
 if(p != NULL) {
  treerecurse(p->left);

  printf("%4d %s\n", p->count, p->word);  // perform what   
                                          //  you desire for
                                          //  each entry
  treerecurse(p->right);
 }
}

---- snippet- ----


Hope this helps,
Joel 

On Thu, 2005-01-27 at 07:01, J. wrote:
> Wednesday, January 26
> 
> Hello,
> 
> I am trying to traverse a binary tree, returning each node that is
> encounterd so that I can preform operations on that node. However it keeps
> looping over the same first node, it refuses to travel any further down
> the tree ... What did I overlooked ? I know the tree is loaded with data
> since a simple recursive preorder treeprint confirms that.
> 
> An example: 
> 
>  while((root = treerecurse(root)) != NULL)
>   printf("%4d %s\n", root->count, root->word);
> 
> And the treerecurse function would look something like:
> 
> struct tnode *treerecurse(struct tnode *p) {
>  if(p != NULL) {
>   treerecurse(p->left);
>   return p;
>   treerecurse(p->right);
>  }
> }
> 
> I guess there is something wrong in my reasoning about this...
> 
> Thnkx..
> 
> J.
> 
> -
> To unsubscribe from this list: send the line "unsubscribe linux-c-programming" in
> the body of a message to majordomo@vger.kernel.org
> More majordomo info at  http://vger.kernel.org/majordomo-info.html
-- 
"Debugging is twice as hard as writing the code in the first place.
Therefore, if you write the code as cleverly as possible, you are,
by definition, not smart enough to debug it." 
					    - Brian W. Kernighan

[-- Attachment #2: This is a digitally signed message part --]
[-- Type: application/pgp-signature, Size: 189 bytes --]

  parent reply	other threads:[~2005-01-27  3:19 UTC|newest]

Thread overview: 5+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2005-01-26 23:01 binary tree traversal J.
2005-01-27  2:07 ` Eric Bambach
2005-01-27 20:06   ` J.
2005-01-27  3:19 ` Joel Pareja [this message]
2005-01-30 11:49 ` Glynn Clements

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=1106795952.983.26.camel@localhost.localdomain \
    --to=jpareja@ntsp.nec.co.jp \
    --cc=linux-c-programming@vger.kernel.org \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).