We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
With respect to context of this problem as this HackerRank question, @ZeaLot4J is correct because this has the most efficient complexities (both time and space). While @tordjarv comments about other scenarios (like multi-threading) make some sense, they are contexts different from this HackerRank question.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Tree: Preorder Traversal
You are viewing a single comment's thread. Return to all comments →
With respect to context of this problem as this HackerRank question, @ZeaLot4J is correct because this has the most efficient complexities (both time and space). While @tordjarv comments about other scenarios (like multi-threading) make some sense, they are contexts different from this HackerRank question.