Enter the binary tree ... 1 / \ 2 3 / \ 4 5 \ / \ 8 6 7 / 9
Root = new Node ( 1 ) ; Root . left = new Node ( 2 ) ; Root . right = new Node ( 3 ) ; Root . left . left = new Node ( 4 ) ; Root . left . right = new Node ( 5 ) ; Root . left . right . left = new Node ( 6 ) ; Root . left . right . right = new Node ( 7 ) ; Root . left . left . right = new Node ( 8 ) ; Root . left . left . right . left = new Node ( 9 ) ; diameter ( Root ) ;