package second_term.tenth_chapter;


public class BinaryTreeNode<T>
{
    public T element;
    public BinaryTreeNode<T> left, right;


    public BinaryTreeNode(T obj) 
    {
        element = obj;
        left = null;
        right = null;
    }


    public BinaryTreeNode(T obj, LinkedBinaryTree<T> left, LinkedBinaryTree<T> right)
    {
        element = obj;
        if (left == null)
            this.left = null;
        else
            this.left = left.getRootNode();
        
         if (right == null)
            this.right = null;
        else
            this.right = right.getRootNode();
    }
    

    public int numChildren() 
    {
        int children = 0;

        if (left != null)
            children = 1 + left.numChildren();

        if (right != null)
            children = children + 1 + right.numChildren();

        return children;
    }

    public boolean IsARoot(LinkedBinaryTree<T> node){//PP10.3
        return node.getLeft()==null&&node.getRight()==null;//是叶子结点
    }
    public T getElement() 
    {
        return element;
    }
    

    public BinaryTreeNode<T> getRight() 
    {
        return right;
    }
    

    public void setRight(BinaryTreeNode<T> node) 
    {
        right = node;
    }
    

    public BinaryTreeNode<T> getLeft() 
    {
        return left;
    }
    

    public void setLeft(BinaryTreeNode<T> node) 
    {
        left = node;
    }
}