src/ADT/Tree/BinaryNode.php
public function search( $value )
	{
		if( $value == $this->value )
			return $this;
		else if( $value < $this->value )
		{
			if( $this->left )
				return $this->left->search( $value );
		}
		else if( $value > $this->value )
		{
			if( $this->right )
				return $this->right->search( $value );
		}
		return NULL;
	}
public function search( $value )
	{
		if( $value == $this->value )
			return $this;
		else if( $value < $this->value )
		{
			if( $this->left )
				return $this->left->search( $value );
		}
		else if( $value > $this->value )
		{
			if( $this->right )
				return $this->right->search( $value );
		}
		return NULL;
	}
public function search ( $ value ) { if ( $ value == $ this -> value ) return $ this ; else if ( $ value < $ this -> value ) { if ( $ this -> left ) return $ this -> left -> search ( $ value ) ; } else if ( $ value > $ this -> value ) { if ( $ this -> right ) return $ this -> right -> search ( $ value ) ; } return NULL ; }
Indicates wheter a Value can be found in the Tree.
@access		public
@param		mixed		$value		Value to be found in the Tree
@return		void
Indicates wheter a Value can be found in the Tree .