package huawei; import java.util.ArrayDeque; import java.util.Queue; public final class Demo { public static class BiNode { public char data; public BiNode left; public BiNode right; public BiNode(char data) { this.data = data; } } public static class BiNodeInfo { public int width = 0; public int height = 0; } /* * Description ��һ������������ȡ�ö������Ŀ����ȡ� * Input Param: head ��Ҫ��ȡ��ȵĶ�����ͷ��� * Return Value: width ��height �߶� */ public static BiNodeInfo getBiNodeInfo(BiNode head) { /* ������ʵ�ֹ��� */ BiNodeInfo bif=new BiNodeInfo(); bif.width=getWidth(head); bif.height=getHeight(head); return bif ; } public static int getHeight(BiNode root){ if(root==null) return 0; int lh=getHeight(root.left); int rh=getHeight(root.right); return (lh>rh)?(lh+1):(rh+1); } public static int getWidth(BiNode root){ if (root == null) return 0; Queue queue = new ArrayDeque(); int maxWitdth = 1; // ���� queue.add(root); // �� while (true) { int len = queue.size(); // ��ǰ��Ľڵ���� if (len == 0) break; while (len > 0) {// ���ǰ�㣬���нڵ BiNode t = queue.poll(); len--; if (t.left != null) queue.add(t.left); // ��һ��ڵ���� if (t.right != null) queue.add(t.right);// ��һ��ڵ���� } maxWitdth = Math.max(maxWitdth, queue.size()); } return maxWitdth; } }
二叉树 宽度 java_求二叉树的深度和宽度 java
最新推荐文章于 2022-04-02 10:56:15 发布