CPMagical CP Library

Problem solution · Java

Design an Expression Tree With Evaluate Function

Design an Expression Tree With Evaluate Function: a Java solution using sliding window or two pointers. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Sliding window or two pointers
Source
walkccc LeetCode Solutions
Length
53 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

Sliding window or two pointers

For Design an Expression Tree With Evaluate Function, the implementation maintains a moving interval and updates only the information that enters or leaves the window.

  1. Choose the invariant that makes a window valid or useful.
  2. Advance the right boundary and add the new element.
  3. Move the left boundary only as needed while maintaining the invariant and updating the answer.

Code notes

  • 53 lines of Java from the credited upstream file 1628.java.
  • The implementation visibly relies on sequence storage, ordered lookup, work queue.
  • 1 loop block detected.

Complexity

Confirm that neither pointer moves backwards; if so, the scan is usually linear apart from the window’s data-structure operations.

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 codeDesign an Expression Tree With Evaluate Function · JavaJava
Use this to learn the idea, then write your own version.
/** * This is the interface for the expression tree Node. * You should not remove it, and you can define some classes to implement it. */ abstract class Node {  public abstract int evaluate();  // define your fields here}; class ExpNode extends Node {  public ExpNode(String val, ExpNode left, ExpNode right) {    this.val = val;    this.left = left;    this.right = right;  }   public int evaluate() {    if (left == null && right == null)      return Integer.parseInt(val);    return op.get(val).apply(left.evaluate(), right.evaluate());  }   private static final Map<String, BinaryOperator<Integer>> op =      Map.of("+", (a, b) -> a + b, "-", (a, b) -> a - b, "*", (a, b) -> a *b, "/", (a, b) -> a / b);  private final String val;  private final ExpNode left;  private final ExpNode right;} /** * This is the TreeBuilder class. * You can treat it as the driver code that takes the postinfix input * and returns the expression tree represnting it as a Node. */ class TreeBuilder {  Node buildTree(String[] postfix) {    Deque<ExpNode> stack = new ArrayDeque<>();     for (final String val : postfix)      if (val.equals("+") || val.equals("-") || val.equals("*") || val.equals("/")) {        ExpNode right = stack.pop();        ExpNode left = stack.pop();        stack.push(new ExpNode(val, left, right));      } else {        stack.push(new ExpNode(val, null, null));      }     return stack.pop();  }}

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 ↗