Amazon interview question
Code to get the depth of a binary tree.
Interview Answers
Anonymous
7 Sept 2011
int depth(node * root) { if (root == null) return 0; return max(depth(root->left), depth(root->right) + 1; }
Code to get the depth of a binary tree.
Anonymous
int depth(node * root) { if (root == null) return 0; return max(depth(root->left), depth(root->right) + 1; }
Check out your Company Bowl for anonymous work chats.