Leetcode Problem 872. Leaf-Similar Trees

872. Leaf-Similar Trees

Leetcode Solutions

Define a helper function dfs that takes a node and a list as arguments.
If the node is a leaf (no left or right child), append its value to the list.
If the node has a left child, recursively call dfs on the left child.
If the node has a right child, recursively call dfs on the right child.
Call the dfs function on root1 and root2, each time with a new list to store leaf values.
After the DFS traversal, compare the two lists of leaf values.
If both lists are equal, return true; otherwise, return false.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen