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:

- Level Order Traversal, Print each level in separate line Medium
- Print all subsets of an array with a sum equal to zero Medium
- Search the Element in a binary tree - With and Without Recursion Beginner
- Populate Next Right Pointers in Each Node Hard
- Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard