**Objective: –** Given a binary tree , Find the max element in it.

**Example:**

**Approach:**

- Use Recursion.
- Max will the
**Max(root, max element in the left subtree, max element in right subtree)** *Recursively solve for the max element in the*left subtree and right subtree.

**Complete Code:**

**Output:**

Max element in Binary Tree: 35