Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree that consists of a node in s and all of that node's descendants.

c++

comment code

typed please,

give input output examples

and test cases

keep code short, and time complexity low

give a list of questions one might ask before solving this