Suppose Binary Tree Stores Integers Write Efficient Methods Give Big Oh Running Times Root Q37156322

java language pleaseSuppose a binary tree stores integers. Write efficient methods (and give their Big-Oh running times) that root T and compute a. The number of even data items b. The sum of all the items in the tree 18.10 take a reference to a binary tree public static <AnyTypes void mysteryPrintC BinaryNode-AnyType t) If 1 2 3 4 5 6 7 if( t nu11) System.out.println( t.getElement); mysteryPrint( t.getleft()); System.out.println( t.getElement; mysteryPrint( t.getRight ); System.out.println( t.getElement()); 9 Show

OR

 

OR