Find the Max element in a Given 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.

Complete Code:Run This Code

Output:

Max element in Binary Tree: 35

Also Read:

- Backtracking - Knight's Tour Problem Hard
- Reverse Alternate levels of a given Binary Tree. Medium
- Convert BST to Greater Sum Tree Medium
- Given a binary tree, Print All the Nodes that don't have Siblings. Beginner
- Dynamic Programming - Stairs Climbing Puzzle Beginner
- Print the Bottom View of the Binary Tree. Medium
- Populate Next Siblings Pointers in a Given Binary Tree OR Populate Next Right Pointers in Each Node Hard
- Dynamic Programming - Rod Cutting Problem Medium