[LeetCode] N-ary Tree Preorder Traversal N叉樹的前序遍歷
Given an n-ary tree, return the preorder traversal of its nodes' values. For example, given a 3-ary tree: Return its preorder traversal ...
原文：[LeetCode] 589. N-ary Tree Postorder Traversal N叉樹的后序遍歷
Given an n ary tree, return thepostordertraversal of its nodes values. For example, given a arytree: Return its postorder traversal as: , , , , , . Note: Recursive solution is trivial, could you do i ...
2018-10-31 10:11 2 1548 推薦指數：
相關推薦
[LeetCode] N-ary Tree Level Order Traversal N叉樹層序遍歷
Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example, given a 3-ary ...
[LeetCode] Encode N-ary Tree to Binary Tree 將N叉樹編碼為二叉樹
Design an algorithm to encode an N-ary tree into a binary tree and decode the binary tree to get the original N-ary tree. An N-ary tree ...
[LeetCode] Maximum Depth of N-ary Tree N叉樹的最大深度
Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down ...
[LeetCode] Construct Binary Tree from Inorder and Postorder Traversal 由中序和后序遍歷建立二叉樹
Given inorder and postorder traversal of a tree, construct the binary tree. Note: You may assume that duplicates do not exist in the tree ...
[LeetCode] 145. Binary Tree Postorder Traversal 二叉樹的后序遍歷
Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, return [3,2,1]. Note ...
[LeetCode] 889. Construct Binary Tree from Preorder and Postorder Traversal 由先序和后序遍歷建立二叉樹
Return any binary tree that matches the given preorder and postorder traversals. Values in the traversals pre and post are distinct positive ...
[LeetCode] 428. Serialize and Deserialize N-ary Tree N叉搜索樹的序列化和去序列化
Serialization is the process of converting a data structure or object into a sequence of bits ...