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:

- Make a Binary Tree from Given Inorder and Preorder Traversal Hard
- Merge or Combine Two Sorted Linked Lists Medium
- Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium
- Convert Sorted Singly Linked List to Balanced Binary Search Tree Medium
- Find and Print Full Nodes in a Binary Tree Beginner