Tree in java
package T rees ; class node { int val ; node left ; node right ; public node ( int val ){ this . val = val ; } } public class NodeTree { public static void main ( String [] args ) { node a = new node ( 1 ); node b = new node ( 4 ); node c = new node ( 3 ); node d = new node ( 2 ); node e = new node ( 6 ); node f = new node ( 5 ); a . left = b ; a . right = c ; b . left = d ; b . right = e ; c . right = f ; System . out . print ( "product of all nodes : " ); System . out . print ( product ( a )); System . out . println (); System . out . print ( "product of non-zero elements of nodes : " ); System . out . print ( product2 ( a )); System . out . println (); System . out . print ( "sum of all nodes : " ); System . out . print ( sum ( a )); System . out . println (); System . out . print ( "Maximum Node in tree : " ); System . out . print ( maximum ( a )); System . out . println (); System . out . print ( ...