Leetcode 428. Serialize and Deserialize N-Ary Tree Explained using DFS pre-order traversal

preview_player
Показать описание
Leetcode 428. Serialize and Deserialize N-ary Tree solved by using the same DFS pre-order traversal in O(N) Time and Space. It's just the extension of Leetcode 297 with a for loop.

#dfs #interviewdose #n-ary-tree
Рекомендации по теме
Комментарии
Автор

Thanks for the explanation!
Can you create a video using BFS method of n-ary trees? Thanks in advance!

niksgupta
Автор

Nice explanation .. any github link for the code?

studio
welcome to shbcf.ru