Coding Challenge · ADVANCED
Given a binary tree, find the maximum path sum where the path must include at least one node and may start and end at any node. However, the path must not contain more than two consecutive nodes that are either both on the left or both on the right of their respective parents.