leetcode572

Overview ¶

* @lc app=leetcode id=572 lang=golang * * [572] Subtree of Another Tree * * https://leetcode.com/problems/subtree-of-another-tree/description/ * * algorithms * Easy (43.69%) * Likes: 1816 * Dislikes: 85 * Total Accepted: 175K * Total Submissions: 400.4K * Testcase Example: '[3,4,5,1,2]\n[4,1,2]' * * * Given two non-empty binary trees s and t, check whether tree t has exactly * the same structure and node values with a subtree of s. A subtree of s is a * tree consists of a node in s and all of this node's descendants. The tree s * could also be considered as a subtree of itself. * * * Example 1: * * Given tree s: * * ⁠ 3 * ⁠ / \ * ⁠ 4 5 * ⁠ / \ * ⁠1 2 * * Given tree t: * * ⁠ 4 * ⁠ / \ * ⁠1 2 * * Return true, because t has the same structure and node values with a subtree * of s. * * * Example 2: * * Given tree s: * * ⁠ 3 * ⁠ / \ * ⁠ 4 5 * ⁠ / \ * ⁠1 2 * ⁠ / * ⁠ 0 * * Given tree t: * * ⁠ 4 * ⁠ / \ * ⁠1 2 * * Return false. *