{"description":"tags: leetcode \u554f\u984c Explore Problems \u30a2\u30a4\u30c7\u30a2 \u304a\u3055\u3089\u3044\u3092\u3059\u308b\u3068\u4e8c\u5206\u6728\u306e\u5834\u5408\u306fPreorder, Inorder, Postorder traversal\u306f\u305d\u308c\u305e\u308c\u6839\u306e\u30ce\u30fc\u30c9\u304c\u3044\u3064\u63a2\u7d22\u3055\u308c\u308b\u304b\u3067\u5206\u985e\u3055\u308c\u3066\u304a\u308a\uff0c Preorder(\u6839\u2192\u5de6\u2192\u53f3) Inorder(\u5de6\u2192\u6839\u2192\u53f3) Postorder(\u5de6\u2192\u53f3\u2192\u6839) \u4eca\u56de\u306f2\u3064\u3088\u308a\u591a\u304f\u306e\u5b50\u3092\u6301\u3064\u6728\u306b\u95a2\u3057\u3066\u305d\u306e\u63a2\u7d22\u3092\u5b9f\u88c5\u3092\u3057\u307e\u3059\uff0e \u89e3\u6cd51(recursive) Preorder\u306f\u6839\u304b\u3089\u898b\u3066\uff0c\u5b50\u306e\u898b\u3066\u3044\u304d\u307e\u3057\u305f\uff0e Postorder\u306f\u5b50\u304b\u3089\u898b\u3066\uff0c\u6839\u3092\u898b\u307e\u3059\uff0e \u8a08\u7b97\u91cf \u30ce\u30fc\u30c9\u306e\u6570\u3092$N$\u3068\u3059\u308b\uff0e \u6642\u9593\u8a08\u7b97\u91cf $O(N)$ \u7a7a\u9593\u8a08\u2026","height":"190","published":"2020-02-19 17:55:25","provider_url":"https://hatena.blog","title":"# LeetCode Easy 590. N-ary Tree Postorder Traversal","type":"rich","image_url":null,"provider_name":"Hatena Blog","author_name":"sosodemonai","blog_url":"https://propyon.hateblo.jp/","categories":["leetcode"],"version":"1.0","width":"100%","blog_title":"Neunomizu\u306e\u65e5\u8a18","author_url":"https://blog.hatena.ne.jp/sosodemonai/","url":"https://propyon.hateblo.jp/entry/2020/02/19/175525","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fpropyon.hateblo.jp%2Fentry%2F2020%2F02%2F19%2F175525\" title=\"# LeetCode Easy 590. N-ary Tree Postorder Traversal - Neunomizu\u306e\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}