构造二叉树，并求二叉树的深度

最新推荐文章于 2024-02-24 12:55:34 发布

湘下农人

最新推荐文章于 2024-02-24 12:55:34 发布

阅读量234

点赞数

分类专栏： java 算法

本文链接：https://blog.csdn.net/boguesfei/article/details/82730566

版权

java 同时被 2 个专栏收录

195 篇文章 1 订阅

订阅专栏

算法

69 篇文章 0 订阅

订阅专栏

import java.util.ArrayList;
import java.util.LinkedList;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;
//构造二叉树，并求二叉树的深度

public class Test {

   /**
   * @param args
   */
   public static void main(String[] args) {
       // TODO Auto-generated method stub

Map<Integer,ArrayList<Integer>> map=new TreeMap<Integer,ArrayList<Integer>>();
Scanner sc = new Scanner(System.in);
while(sc.hasNextInt()){

   int key=sc.nextInt();
   if(!map.containsKey(key)){
       ArrayList<Integer> list=new ArrayList<Integer>();
       list.add(sc.nextInt());
           map.put(key, list);
           }
   else{
       ArrayList<Integer> list=map.get(key);
       list.add(sc.nextInt());
       map.put(key, list);
   }

       }
TreeNode root = new TreeNode(0);
if(map==null) return;

LinkedList<TreeNode> queue = new LinkedList<>();

queue.add(root);
TreeNode current;
while (!queue.isEmpty()) {

   current=queue.poll();
   int key=current.val;
   if(!map.containsKey(key)) continue;
   ArrayList<Integer> list=map.get(key);
   if(list==null||list.size()<1) continue;
   int n=list.size();
   if(n==1){
       int tmp=list.get(0);
       TreeNode node=new TreeNode(tmp);
       if(tmp==2*key+1) root.left=node;
       else if(tmp==2*key+2) root.right=node;
       queue.add(node);
   }
   else if(n==2){
       int tmp=list.get(0);
       TreeNode node=new TreeNode(tmp);

       if(tmp==2*key+1) root.left=node;
       else if(tmp==2*key+2) root.right=node;
       int tmp1=list.get(1);
       TreeNode node1=new TreeNode(tmp1);
       if(tmp1==2*key+1) root.left=node1;
       else if(tmp1==2*key+2) root.right=node1;
       queue.add(node);
       queue.add(node1);
   }
}
int x=maxDepth(root);
System.out.println(x+1);

   }

   public static int maxDepth(TreeNode root) {
return root == null ? 0 : (1 + Math.max(maxDepth(root.left), maxDepth(root.right)));
}
}
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode(int x) {
val = x;
}
}