// Prevzato z: 
// http://www.cs.plu.edu/pub/faculty/csce270/summer00/labs/lab6/BinarySearchTree.java

class TiskStromu {
	Polozka vrchol;
	public TiskStromu (Strom strom) {
		this.vrchol = strom.vrchol;	
	}
	
	protected String tiskniStrom(Polozka p, int vnoreni) {
		String s = new String();

     	if ( p != null) {
        	s = this.tiskniStrom(p.vpravo, vnoreni+1);
        	
        	for (int j=0; j<vnoreni; j++) s +="\t";
        	
        	s +=" "+p.klic;
        	
        	if ((p.vlevo != null) && (p.vpravo != null)) {
            	s += "<";
        	} else if (p.vpravo != null) {
            	s += "/";
        	} else if (p.vlevo != null) {
            	s += "\\";
            }
            
        	s += "\n" + this.tiskniStrom(p.vlevo, vnoreni+1);
    	}
    	return s;
	}


	// Outputs the keys in a binary search tree. The tree is output
	// rotated counterclockwise 90 degrees from its conventional
	// orientation using a "reverse" inorder traversal. This operation is
	// intended for testing and debugging purposes only.
	public void tiskni() {
		System.out.println(this.tiskniStrom(this.vrchol, 0));
	}
}