Identical language syntax tree

The diagram below shows a simplified visualization of a language syntax tree for a basic arithmetic expression.

Given the root of the two binary trees (a and b), determine if the trees are identical in both structure and node values. Return a boolean value.

const isIdentical = (a, b) => {
// Enter your logic here...
}

Examples:

Input: a = [+,*,5,3,4], b = [+,*,5,3,4]
Output: true
Explanation: Both the binary trees are identical in structure and node values.

Input: a = [+,*,5,3,4], b = [+,*,5,4,3]
Output: false
Explanation: Both the binary trees are identical in structure but different in node values.

Test Case	Input	Expected Output
Test Case 1	a = [+,,5,3,4], b = [+,,5,3,4]	true
Test Case 2	a = [+,,5,3,4], b = [+,,5,4,3]	false

Discussion