Java中二叉树与N叉树的示例分析

这篇文章主要介绍了Java中二叉树与N叉树的示例分析，具有一定借鉴价值，感兴趣的朋友可以参考下，希望大家阅读完这篇文章之后大有收获，下面让小编带着大家一起了解一下。

题目一

解法

/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode() {} *     TreeNode(int val) { this.val = val; } *     TreeNode(int val, TreeNode left, TreeNode right) { *         this.val = val; *         this.left = left; *         this.right = right; *     } * } */class Solution {    StringBuffer sb = new StringBuffer();    List list = new ArrayList();    public List binaryTreePaths(TreeNode root) {        method(root);        return list;    }    public void method(TreeNode root){        if(root==null) return;        int t = sb.length();        sb.append(root.val);        if(root.left==null&&root.right==null){            list.add(sb.toString());        }        sb.append("->");        method(root.left);        method(root.right);        sb.delete(t, sb.length());    }}

题目二

解法

/** * Definition for a binary tree node. * public class TreeNode { *     int val; *     TreeNode left; *     TreeNode right; *     TreeNode() {} *     TreeNode(int val) { this.val = val; } *     TreeNode(int val, TreeNode left, TreeNode right) { *         this.val = val; *         this.left = left; *         this.right = right; *     } * } */class Solution {    int ans = 0;    public int sumOfLeftLeaves(TreeNode root) {        method(root,false);        return ans;    }    public void method(TreeNode root,boolean flag){        if(root==null) return;        if(root.left==null&&root.right==null&&flag){            ans+=root.val;            return;        }        method(root.left,true);        method(root.right,false);    }}

题目三

解法

/*// Definition for a Node.class Node {    public int val;    public List children;    public Node() {}    public Node(int _val) {        val = _val;    }    public Node(int _val, List _children) {        val = _val;        children = _children;    }};*/ class Solution {    public int maxDepth(Node root) {        if(root==null){            return 0;        }        int maxChildDepth = 0;        for(int i = 0;i
感谢你能够认真阅读完这篇文章，希望小编分享的"Java中二叉树与N叉树的示例分析"这篇文章对大家有帮助，同时也希望大家多多支持，关注行业资讯频道，更多相关知识等着你来学习!