Codestin Search App

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 515: Find Largest Value in Each Tree Row

Problem Restatement We are given the root of a binary tree. For every depth level in the tree, we need to find the largest node value on that row. Return the results as an array where: answer[i] is the maximum value on depth i . The official problem asks us to return the largest value in each row of a binary tree. Input and Output Item Meaning Input The root...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 513: Find Bottom Left Tree Value

Problem Restatement We are given the root of a binary tree. We need to return the leftmost value in the last row of the tree. The last row means the deepest level of the tree. The leftmost value means the first node on that deepest level when reading from left to right. The official problem asks us to return the leftmost value in the last row of a binary tree....

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 429: N-ary Tree Level Order Traversal

Problem Restatement We are given the root of an N-ary tree. We need to return the level order traversal of its node values. Level order traversal means: Visit all nodes on level 0 Then all nodes on level 1 Then all nodes on level 2 Continue until the tree is finished For each level, we store the node values in a separate list. The final answer is therefore a list...

#level-order-traversal

LeetCode 515: Find Largest Value in Each Tree Row

LeetCode 513: Find Bottom Left Tree Value

LeetCode 429: N-ary Tree Level Order Traversal