• Categories

  • your are stumbler#

    • 26,445
  • Author

  • Recent comments:

    over at this website on Interesting read about Interne…
    Gmail Inbox Tabs and… on Malkovich Bias
    guptaradhesh on Yahoo acquires Tumblr! Great…
  • Advertisements

compute max-depth of a binary tree

Posted by guptaradhesh on December 8, 2010

int maxDepth(struct node* node)


if (node==NULL) { return(0);


else {

int leftDepth = maxDepth(node->left);

int rightDepth = maxDepth(node->right);

if (leftDepth > rightDepth)




} }


Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: