left view of a binary tree.
| 20 | |
| 21 | // left view of a binary tree. |
| 22 | void leftViewUtil(struct Node *root, |
| 23 | int level, int *max_level) |
| 24 | { |
| 25 | |
| 26 | if (root == NULL) return; |
| 27 | |
| 28 | |
| 29 | if (*max_level < level) |
| 30 | { |
| 31 | cout << root->data << " "; |
| 32 | *max_level = level; |
| 33 | } |
| 34 | |
| 35 | leftViewUtil(root->left, level + 1, max_level); |
| 36 | leftViewUtil(root->right, level + 1, max_level); |
| 37 | |
| 38 | } |
| 39 | |
| 40 | |
| 41 | void leftView(struct Node *root) |