Maximum Depth of Binary Tree

This Java project solves the Maximum Depth of Binary Tree problem for a binary tree using command-line input. It's structured to build and run via Apache Ant, producing a runnable .jar file.

---

🧩 Problem Statement

Given the root of a binary tree, return its maximum depth.

A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

---

✅ Example

Input:

java -jar dist/lib/dist.jar "[3,9,20,null,null,15,7]"

⚙️ How to Build and Run

ant clean dist
java -jar dist/lib/dist.jar "[1,null,2]"