CPMagical CP Library

Problem solution · Java

Check If Two Expression Trees are Equivalent

Check If Two Expression Trees are Equivalent: a Java solution using depth-first search. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Depth-first search
Source
walkccc LeetCode Solutions
Length
18 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Depth-first search

For Check If Two Expression Trees are Equivalent, the implementation follows one branch at a time, making it suitable for components, trees, backtracking, or dependency exploration.

  1. Define the state carried into one recursive or stack frame.
  2. Mark or choose the current state before exploring children.
  3. Combine child results or undo the choice when the branch finishes.

Code notes

  • 18 lines of Java from the credited upstream file 1612.java.
  • The implementation visibly relies on sequence storage.
  • No explicit loop blocks detected, together with recursive traversal.

Complexity

Count unique states for graph traversal; for backtracking, count the branching factor and maximum depth.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeCheck If Two Expression Trees are Equivalent · JavaJava
Use this to learn the idea, then write your own version.
class Solution {  public boolean checkEquivalence(Node root1, Node root2) {    int[] count = new int[26];    dfs(root1, count, 1);    dfs(root2, count, -1);    return Arrays.stream(count).filter(c -> c != 0).count() == 0;  }   private void dfs(Node root, int[] count, int add) {    if (root == null)      return;    if ('a' <= root.val && root.val <= 'z')      count[root.val - 'a'] += add;    dfs(root.left, count, add);    dfs(root.right, count, add);  }}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗