Given two binary trees, return true if they are structurally identical (they have nodes with the same values, arranged in the same way).
boolean MBTsame(BSTNode root1, BSTNode root2) { // Your code goes between these lines // Your code goes between these lines }

To be identical, roots must match in value.

Then, the left subtree of the first tree must match the left subtree of the second tree. And the right subtree of the first tree must match the right subtree of the second tree.