#include <stdio.h> typedef struct Node { int data; struct Node *left, *right; } Node; typedef Node* Tree; #define min(a, b)(a)<(b)?(a):(b) int mindepth(Tree t) { if(t == NULL || (t->left == NULL && t->right == NULL)) return 0; return min( 1 + mindepth(t->left), 1 + mindepth(t->right) ); }
- Comment
- Reblog
-
Subscribe
Subscribed
Already have a WordPress.com account? Log in now.
Effective Programming 
if(t == NULL || t->left == NULL || t->right == NULL)This would be true even if you reach a node with one child, instead it should be true only if you reach a leaf node i.e. right = left = NULL.So, I think the correct code should be,if(t == NULL || (t->left == NULL && t->right == NULL))
hmmmm its helped me in my bst class thanks
cool
This code is wrong! If you test it in http://leetcode.com/onlinejudge#question_116, only the NULL test can pass
Nice post. I learn something totally new and challenging on websites I stumbleupon
everyday. It will always be useful to read content from other writers and practice a little something from their web sites.