class node{ int data; node left; node right; node( int data){ this .data=data; } } class treeHeight{ node root; treeHeight(){ root= null ; } public static void main( String [] args){ treeHeight t=new treeHeight(); t.insert( 15 ); t.insert( 20 ); t.insert( 10 ); t.insert( 5 ); t.insert( 2 ); System.out.println(t.height(t.root)); } public void insert( int data){ root=addNode(root,data); } public node addNode(node root, int data){ if (root== null ){ return new node(data); } else if (root.data<data){ root.right=addNode(root.right,data); } else if (root.data>data){ root.left=addNode(root.left,data); } else { return root; } return root; } /* 15,20,10,5 Regression Is Used To Divide a Hu...
dsaJavaCpp Is a Personnel Blog To Learn Basic Programming Data structures and Algorithms For Develop My Programming Skills And Prepare coding Interview. The Blog Contains Basic Algorithms Such As, Divide and Con quire, Linear And non Linear Data Structures.