2022-03-27 20:46:41 +08:00
< p > Given the < code > root< / code > of an n-ary tree, return < em > the preorder traversal of its nodes' values< / em > .< / p >
< p > Nary-Tree input serialization is represented in their level order traversal. Each group of children is separated by the null value (See examples)< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:46:41 +08:00
< p > < img src = "https://assets.leetcode.com/uploads/2018/10/12/narytreeexample.png" style = "width: 100%; max-width: 300px;" / > < / p >
< pre >
< strong > Input:< / strong > root = [1,null,3,2,4,null,5,6]
< strong > Output:< / strong > [1,3,5,6,2,4]
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 20:46:41 +08:00
< p > < img alt = "" src = "https://assets.leetcode.com/uploads/2019/11/08/sample_4_964.png" style = "width: 296px; height: 241px;" / > < / p >
< pre >
< strong > Input:< / strong > root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
< strong > Output:< / strong > [1,2,3,6,7,11,14,4,8,12,5,9,13,10]
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > The number of nodes in the tree is in the range < code > [0, 10< sup > 4< / sup > ]< / code > .< / li >
< li > < code > 0 < = Node.val < = 10< sup > 4< / sup > < / code > < / li >
< li > The height of the n-ary tree is less than or equal to < code > 1000< / code > .< / li >
< / ul >
< p > < / p >
< p > < strong > Follow up:< / strong > Recursive solution is trivial, could you do it iteratively?< / p >
