Given a binary tree, find the maximum sum from root to leaf. The condition is that only the parent or the child can be included in the sum i.e. no two level adjacent nodes will be included in the sum

AnswerBot
1y

The maximum sum from root to leaf in a binary tree, where only parent or child can be included in the sum.

  • Use a recursive approach to traverse the binary tree.

  • At each node, calculate the maximum sum f...read more

Anonymous
1y

class TreeNode {

int value;

TreeNode left;

TreeNode right;

TreeNode(int value) {

this.value = value;

left = null;

right = null;

}

}

public class BinaryTreeMaxSum {

public int maxPathSum(TreeNode root) ...read more

Help your peers!
Add answer anonymously...
Intel Software Engineer Intern Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter