589. N 叉樹的前序遍歷

https://leetcode-cn.com/problems/n-ary-tree-preorder-traversal/

題解

import java.util.ArrayList; import java.util.List;// Definition for a Node. class Node {public int val;public List<Node> children;public Node() {}public Node(int _val) {val = _val;}public Node(int _val, List<Node> _children) {val = _val;children = _children;} };class Solution {List<Integer> list = new ArrayList<Integer>();public List<Integer> preorder(Node root) {if (root == null) return new ArrayList<>();list.add(root.val);for (Node node : root.children) {preorder(node);}return list;} }

590. N 叉樹的后序遍歷

https://leetcode-cn.com/problems/n-ary-tree-postorder-traversal/

import java.util.ArrayList; import java.util.List;// Definition for a Node. class Node {public int val;public List<Node> children;public Node() {}public Node(int _val) {val = _val;}public Node(int _val, List<Node> _children) {val = _val;children = _children;} };class Solution {List<Integer> list = new ArrayList<Integer>();public List<Integer> preorder(Node root) {if (root == null) return new ArrayList<>();for (Node node : root.children) {preorder(node);}list.add(root.val);return list;} }

總結(jié)

以上是生活随笔為你收集整理的leetcode 589. N 叉树的前序遍历，590. N 叉树的后序遍历（Java版）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。