100. Same Tree

发布时间：2020-12-14 04:37:27 所属栏目：大数据来源：网络整理

导读：Given two binary trees,write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical and the nodes have the same value. Example 1: Input: 1 1 / / 2 3 2 3 [1,2,3],[1,3]

Given two binary trees,write a function to check if they are the same or not.

Two binary trees are considered the same if they are structurally identical and the nodes have the same value.

Example 1:

Input:     1         1
          /        /          2   3     2   3

        [1,2,3],[1,3]

Output: true

Example 2:

Input:     1         1
          /                    2             2

        [1,2],null,2]

Output: false

Example 3:

Input:     1         1
          /        /          2   1     1   2

        [1,1],1,2]

Output: false

二叉树有三种遍历方式，先序遍历，中序遍历以及后序遍历

采用中序遍历，进行逐结点进行比较

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!