algorithm - 检查树是否为二叉树

Question

给定一棵(n 叉)树。如何判断是否为二进制？

Answer 1

How to check whether it is binary or not?

检查每个节点是否最多有 2 个子节点。

一些未经测试的(!)伪代码:

struct NTree {

  root: Node

  boolean isBinary() {
    return isBinary(root)
  }

  private boolean isBinary(Node n) {
    if (n has no child)
      return true
    elif (n has 1 child)
      return isBinary(n.children[0])
    elif (n has 2 children)
      return isBinary(n.children[0]) && isBinary(n.children[1])
    else
      return false
  }

  struct Node {
    children: List
  }
}