Binary Tree Longest Consecutive Sequence: Post-Order Traversal

-
Problem is here: https://leetcode.com/problems/binary-tree-longest-consecutive-sequence/
298. Binary Tree Longest Consecutive Sequence
Medium
Given a binary tree, find the length of the longest consecutive sequence path.
The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections. The longest consecutive path need to be from parent to child (cannot be the reverse).
Example 1:
Input:

   1
    \
     3
    / \
   2   4
        \
         5

Output: 3

Explanation: Longest consecutive sequence path is 3-4-5, so return 3.
Example 2:
Input:

   2
    \
     3
    / 
   2    
  / 
 1

Output: 2 

Explanation: Longest consecutive sequence path is 2-3, not 3-2-1, so return 2.
Best option is to perform a post-order tree traversal:

  • Call for the left node
  • Call for the right node
  • Then calculate the value of the current node by checking whether the left AND the right are potential candidates for a sequence
Because the sequence has to be in increasing order, it limits the different conditions to check for. Still, there are some variations that need to be addressed, like when only one node exists, both exist, when only one node match the increasing condition, when both match, and so on. Code is down below, cheers, ACC.


public class Solution
{
    public int LongestConsecutive(TreeNode root)
    {
        int longestEndingHere = 0;
        int longest = 0;
        LongestConsecutive(root, ref longestEndingHere, ref longest);
        return longest;
    }

    private void LongestConsecutive(TreeNode node,
                                    ref int longestEndingHere,
                                    ref int longest)
    {
        if (node == null) return;

        int leftLongestEndingHere = 0;
        LongestConsecutive(node.left, ref leftLongestEndingHere, ref longest);
        int rightLongestEndingHere = 0;
        LongestConsecutive(node.right, ref rightLongestEndingHere, ref longest);

        longestEndingHere = 1;
        if (node.left == null && node.right == null)
        {
            //No-op
        }
        else if (node.left == null)
        {
            if (node.val + 1 == node.right.val)
            {
                longestEndingHere += rightLongestEndingHere;
            }
        }
        else if (node.right == null)
        {
            if (node.val + 1 == node.left.val)
            {
                longestEndingHere += leftLongestEndingHere;
            }
        }
        else
        {
            if (node.val + 1 == node.right.val && node.val + 1 == node.left.val)
            {
                longestEndingHere += Math.Max(leftLongestEndingHere, rightLongestEndingHere);
            }
            else if (node.val + 1 == node.right.val)
            {
                longestEndingHere += rightLongestEndingHere;
            }
            else if (node.val + 1 == node.left.val)
            {
                longestEndingHere += leftLongestEndingHere;
            }
        }

        longest = Math.Max(longest, longestEndingHere);
    }
}

Comments

Post a Comment

Popular posts from this blog

Golang vs. C#: performance characteristics (simple case study)

-
Image
This is an interesting example to study the performance characteristics of Golang compared to C# for a very particular case (not generalized though).  The same code was written in C# and Golang (literally translated from one to the other). Below you'll be able to see the source code for both. The problem is a simple post-order DFS in a tree-like graph. The code in C# times out (TLE = Time Limited Exceeded). The code in Golang not only works but beats 100% of the other Golang submissions. Take a look the image below: Some potential reasons for the performance gains from Go in this particular example are: 1. Language and Runtime Differences:    Go is compiled directly to machine code, while C# typically runs on a virtual machine (CLR).    Go has a simpler runtime with less overhead compared to the .NET runtime.    Go's garbage collector is designed for low latency, which can lead to better performance in some scenarios. 2. Data Structures:    Go's `map` is generally more effi
Read more

Claude vs ChatGPT: A Coder's Perspective on LLM Performance

-
Image
In the rapidly evolving world of Large Language Models (LLMs), recent releases from OpenAI's ChatGPT have garnered significant attention. However, when it comes to coding tasks, Anthropic's Claude.ai continues to impress me with its speed and quality of output. Benchmarking with LeetCode While LeetCode problems aren't the definitive measure of an AI's coding capabilities (they're pre-designed puzzles, after all), they offer an interesting playground for comparison. Let's dive into a recent example: The Problem K-th Largest Perfect Subtree Size in Binary Tree - LeetCode 3319. K-th Largest Perfect Subtree Size in Binary Tree Medium 36 6 Add to List Share You are given the  root  of a  binary tree  and an integer  k . Return an integer denoting the size of the  k th   largest   perfect binary   subtree , or  -1  if it doesn't exist. A  perfect binary tree  is a tree where all leaves are on the same level, and every parent has two children.   Example 1: Input:  
Read more

ProjectEuler Problem 719 (some hints, but no spoilers)

-
Image
Last time that I solved a ProjectEuler (PE) problem was in 2015... This is their latest problem as of today:  https://projecteuler.net/problem=719 Number Splitting        Problem 719 We define an  S S -number to be a natural number,  n n , that is a perfect square and its square root can be obtained by splitting the decimal representation of  n n  into 2 or more numbers then adding the numbers. For example, 81 is an  S S -number because  81 − − √ = 8 + 1 81 = 8 + 1 . 6724 is an  S S -number:  6724 − − − − √ = 6 + 72 + 4 6724 = 6 + 72 + 4 . 8281 is an  S S -number:  8281 − − − − √ = 8 + 2 + 81 = 82 + 8 + 1 8281 = 8 + 2 + 81 = 82 + 8 + 1 . 9801 is an  S S -number:  9801 − − − − √ = 98 + 0 + 1 9801 = 98 + 0 + 1 . Further we define  T ( N ) T ( N )  to be the sum of all  S S  numbers  n ≤ N n ≤ N . You are given  T ( 10 4 ) = 41333 T ( 10 4 ) = 41333 . Find  T ( 10 12 ) The rules of PE prevent me from disclosing the solution (they are very picky about it, rightfully so), but I can chat abo
Read more