2018年10月31日
[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 as: [1,3,5,6,2 阅读全文
posted @ 2018-10-31 10:48 Grandyang 阅读(3403) 评论(1) 推荐(1) 编辑
[LeetCode] 589. N-ary Tree Postorder Traversal N叉树的后序遍历
摘要： Given an n-ary tree, return the postorder traversal of its nodes' values. For example, given a 3-ary tree: Return its postorder traversal as: [5,6,3,2 阅读全文
posted @ 2018-10-31 10:11 Grandyang 阅读(2490) 评论(2) 推荐(0) 编辑
Fork me on GitHub