Function to find height of a tree */
| 10 | |
| 11 | /* Function to find height of a tree */ |
| 12 | int height(Node *root, int &ans) |
| 13 | { |
| 14 | if (root == NULL) |
| 15 | return 0; |
| 16 | |
| 17 | int left_height = height(root->left, ans); |
| 18 | |
| 19 | int right_height = height(root->right, ans); |
| 20 | |
| 21 | // update the answer, because diameter of a |
| 22 | // tree is nothing but maximum value of |
| 23 | // (left_height + right_height + 1) for each node |
| 24 | ans = max(ans, 1 + left_height + right_height); |
| 25 | |
| 26 | return 1 + max(left_height, right_height); |
| 27 | } |
| 28 | |
| 29 | /* Computes the diameter of binary tree with given root. */ |
| 30 | int diameter(Node *root) |