Leetcode Problem 988. Smallest String Starting From Leaf

988. Smallest String Starting From Leaf

Leetcode Solutions

Define a recursive function dfs that takes a node and the current path string as arguments.
If the node is a leaf, reverse the current path string and compare it with the smallest string found so far. Update the smallest string if necessary.
If the node has a left child, recursively call dfs with the left child and append the current node's character to the path string.
If the node has a right child, recursively call dfs with the right child and append the current node's character to the path string.
After exploring both children, backtrack by removing the current node's character from the path string.
Once the DFS is complete, return the smallest string found.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen