Skip to content

Latest commit

 

History

History
19 lines (10 loc) · 296 Bytes

File metadata and controls

19 lines (10 loc) · 296 Bytes

Problem 100: Same Tree

Difficulty: Easy

Problem

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

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

Example

Self-explanatory