budget/src/main/java/budget/backend/structures/BinaryTreeNode.java
public boolean isLeft(){
	  if ((this.parent != null) && (this.equals(parent.getLeft())))
	  	return true;
	  return false;
	}
/**
	 * @return true if the node is the left child of its parent (if exists)
	 * @return false if the node is either the right child or the root
	 */
@return true if the node is the left child of its parent (if exists)
@return false if the node is either the right child or the root
@return true if the node is the left child of its parent ( if exists ) @return false if the node is either the right child or the root
public boolean isLeft(){
	  if ((this.parent != null) && (this.equals(parent.getLeft())))
	  	return true;
	  return false;
	}
public boolean isLeft ( ) { if ( ( this . parent != null ) && ( this . equals ( parent . getLeft ( ) ) ) ) return true ; return false ; }
@return true if the node is the left child of its parent (if exists)
 @return false if the node is either the right child or the root
@return true if the node is the left child of its parent ( if exists ) @return false if the node is either the right child or the root