void function ( BinaryTreenode < E > arg0 , String arg1 ) { if ( arg0 . getData ( ) != null ) { System . out . println ( arg1 + arg0 . getData ( ) ) ; } arg1 += "srini_string" ; if ( arg0 . getLeft ( ) != null ) { printHelp ( arg0 . getLeft ( ) , arg1 ) ; } if ( arg0 . getRight ( ) != null ) { printHelp ( arg0 . getRight ( ) , arg1 ) ; } }
recursive method to pre-order print the tree , starting at the root . each additional level of the tree should be incremented by three spaces . concode_field_sep BinaryTreenode<E> current concode_elem_sep BinaryTreenode<E> root concode_field_sep void print concode_elem_sep void goRight concode_elem_sep void start concode_elem_sep void addLeftChild concode_elem_sep void changeCurrent concode_elem_sep void addRightChild concode_elem_sep E getCurrent concode_elem_sep void goLeft concode_elem_sep boolean isLeaf