fullBTree.php

<?php // Java program to check if binay tree is full or not 

/* Tree node structure */
class Node 
{ 
	public $data; 
	// Node $left, $right; 
	public $left;
	public $right; 

	function __construct($item) 
	{ 
		$this->data = $item; 
		$this->left = $this->right = null; 
	} 
} 

class BinaryTree extends Node
{ 
	// public $root = new Node; 
	function __construct()
	{
		 parent::__construct();
	}
	
	/* this function checks if a binary tree is full or not */
	function isFullTree($node) 
	{ 
		// if empty tree 
		if($node == null) 
		return true; 
		
		// if leaf node 
		if($node->left == null && $node->right == null ) 
			return true; 
		
		// if both left and right subtrees are not null 
		// the are full 
		if(($node->left!=null) && ($node->right!=null)) 
			return (isFullTree($node->left) && isFullTree($node->right)); 
		
		// if none work 
		return false; 
	} 

	 
	
} 

		$tree = new BinaryTree(); 
		$tree->root = new Node(10); 
		/*tree.root.left = new Node(20); 
		tree.root.right = new Node(30); 
		tree.root.left.right = new Node(40); 
		tree.root.left.left = new Node(50); 
		tree.root.right.left = new Node(60); 
		tree.root.left.left.left = new Node(80); 
		tree.root.right.right = new Node(70); 
		tree.root.left.left.right = new Node(90); 
		tree.root.left.right.left = new Node(80); 
		tree.root.left.right.right = new Node(90); 
		tree.root.right.left.left = new Node(80); 
		tree.root.right.left.right = new Node(90); 
		tree.root.right.right.left = new Node(80); 
		tree.root.right.right.right = new Node(90); 
		*/
		if($tree.isFullTree($tree->root)) 
			var_dump("The binary tree is full"); 
		else
			var_dump("The binary tree is not full"); 

// This code is contributed by Mayank Jaiswal 
?>