BinaryTreeMaximumPathSum (Graph/Tree)

Topic: 09. Trees

1. Structure Analysis

• Type: (Directed/Undirected)? (Cyclic/Acyclic)?
• Traversal: BFS or DFS?

2. Edge Cases

• [ ] Root is null?

3. Complexity

• Time: O(V + E) or O(N)
• Space: O(H) or O(V)

4. Code

package com.dsa.trees;

import com.dsa.utils.TreeNode;
import java.util.*;

public class BinaryTreeMaximumPathSum {
    public void solve() {
        // TODO: Implementation
    }
}