Link to Problem: https://leetcode.com/problems/subtree-of-another-tree

Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise.

A subtree of a binary tree tree is a tree that consists of a node in tree and all of this node's descendants. The tree tree could also be considered as a subtree of itself.

graph
  A(root) --> B((3))
  B --> C((4))
  B --> D((5))
  C --> E((1))
  C --> F((2))

  G(subRoot) --> H((4))
  H --> I((1))
  H --> J((2))

Input: root = [3,4,5,1,2], subRoot = [4,1,2]
Output: true

graph
  A((root)) --> B((3))
  B --> C((4))
  B --> D((5))
  C --> E((1))
  C --> F((2))
  F --> G((0))
  F --> H((nil))

  I(subRoot) --> J((4))
  J --> K((1))
  J --> L((2))

Input: root = [3,4,5,1,2,null,null,null,null,0], subRoot = [4,1,2]
Output: false

Part of the solution for this comes from 100 - Same Tree, so I just reused that.

The thing that I struggled with in this problem was figuring out how to end the recursion and keep it going.

It's actually just really simple, but getting to that solution was not something that just came to me naturally.