# 469.Identical Binary Tree

## 1.Description(Easy)

Check if two binary trees are identical. Identical means the two binary trees have the same structure and every identical position has the same value.

**Example**

```
    1             1
   / \           / \
  2   2   and   2   2
 /             /
4             4
```

are identical.

```
    1             1
   / \           / \
  2   3   and   2   3
 /               \
4                 4
```

are not identical.

## 2.Code

```
 public boolean isIdentical(TreeNode a, TreeNode b) {
        if (a == null && b == null ) return true;
        else if (a == null) return false;
        else if (b == null) return false;
        if (a.val != b.val) return false;
        return isIdentical(a.left, b.left) && isIdentical(a.right, b.right);
    }
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://junnie.gitbook.io/nine-chapter/2.binary-tree/469identical-binary-tree.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.