Structurally Identical Binary Trees Exercise

(function(){ window.OpenPopKa = true;}())

Given two binary trees, return True if and only if they are structurally identical (ignoring the content of the nodes).
boolean MBTstructure(BSTNode root1, BSTNode root2) { // Your code goes between these lines // Your code goes between these lines }

[editor.getValue()]

if (guess[0] != initEditor) { console.log(guess[0]); window.codeValue = guess[0]; window.progexType= "BTRecurTutor"; window.summexName= "MBTstructurePROG"; } else { return ""; }

To be identical in structure, 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.