138. Find the Maximum Value in a Binary Tree

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.

Output:

Max element in Binary Tree: 35

Related Problems:

- Print a path from Root to Node in Binary Tree Medium
- In a Binary Tree, Check if Two nodes has the same parent or are siblings Medium
- Given an array, print all unique subsets with a given sum. Medium
- Check if One Binary Tree is a Subtree of Another Medium
- Diameter Of a Binary Tree Hard