判断满二叉树

class Node {
    int data;
    Node left;
    Node right;
}

public class Demo {
    
    public static boolean isF(Node head) {
        // 满二叉树  节点数 = 2 ** 高度 - 1
        if (head == null) {
            return true;
        }
        Info data = f(head);
        return data.nodes == (1 << data.height - 1);

    }

    public static class Info {
        public int height;
        public int nodes;

        public Info(int h, int n) {
            height = h;
            nodes = n;
        }
    }

    public static Info f(Node x) {
        if (x == null) {
            return new Info(0, 0);
        }
        Info leftData = f(x.left);
        Info rightData = f(x.right);
        int height = Math.max(leftData.height, rightData.height) + 1;  // 头高度
        int nodes = leftData.nodes + rightData.nodes + 1;  // 头节点
        return new Info(height, nodes);
    }
}