判断满二叉树 FBT Full Binary Tree

最新推荐文章于 2024-08-07 07:30:00 发布

EricFang0001

最新推荐文章于 2024-08-07 07:30:00 发布

阅读量56

点赞数

分类专栏： Java 算法文章标签： java

本文链接：https://blog.csdn.net/m0_53085340/article/details/129428649

版权

Java 同时被 2 个专栏收录

33 篇文章 0 订阅

订阅专栏

算法

6 篇文章 0 订阅

订阅专栏

import java.util.LinkedList;
import java.util.Queue;

public class FBTree {
    public static void main(String[] args) {
        Node root = new Node(1);
        Node node2 = new Node(2);
        Node node3 = new Node(3);
        Node node4 = new Node(4);
        Node node5 = new Node(5);
        Node node6 = new Node(6);
        Node node7 = new Node(7);
        Node nodeEx = new Node(0);
        root.left = node2;
        root.right = node3;
        node2.left = node4;
        node2.right = node5;
        node3.left = node6;
        //node3.right = node7;
        Queue<Node> queue = new LinkedList<>();
        boolean res = isFBT(root, queue);
        System.out.println(res);
    }

    // 指示器：true为遇到了左右都为空的节点
    static boolean isLeaf = false;
    static boolean isFBT(Node root, Queue<Node> queue) {
        if (root == null) return true;
        queue.add(root);
        while (!queue.isEmpty()) {
            Node cur = queue.poll();
            if ((isLeaf && (cur.left != null || cur.right != null))
                    || (cur.left == null && cur.right != null)
                    || (cur.left != null && cur.right == null)) {
                return false;
            }
            if (cur.left == null && cur.right == null) {
                isLeaf = true;
            }
            if (cur.left != null) queue.add(cur.left);
            if (cur.right != null) queue.add(cur.right);
        }
        return true;
    }
}