Binary Tree ,Depth and Height

Step [1]:-

First Create Binary Tree class here is TreeNode.java which is given below:-

package com.developerstechpoint.Tree; public class TreeNode { /** * @author jeetendra * */ int data; TreeNode left; TreeNode right; TreeNode(int d){ data=d; left=null; right=null; } }

Step [2]:-

Create A class for all Its Methods like PreOrder,PostOrder,InOrder Traversal ,Depth and Height.Here class name is BinaryTreeMethods.java which is given below:-

package com.developerstechpoint.Tree; public class BinaryTreeMethods { /** * @author jeetendra * */ // Node insertion to create Binary Tree public void insertNode(TreeNode node,int data){ if(data < node.data){ if(node.left!=null){ insertNode(node.left, data); } else{ node.left=new TreeNode(data); } } else{ if(node.right!=null){ insertNode(node.right, data); } else{ node.right=new TreeNode(data); } } } //Pre-Order traversal of binary tree public void preOrder(TreeNode node){ if(node!=null){ System.out.println(node.data); preOrder(node.left); preOrder(node.right); } } //Post-Order traversal of binary tree public void postOrder(TreeNode node){ if(node!=null){ postOrder(node.left); postOrder(node.right); System.out.println(node.data); }} // In-Order traversal in binary tree public void inOrder(TreeNode node){ if(node!=null){ inOrder(node.left); System.out.println(node.data); inOrder(node.right); } } //Finding Depth and Height of the binary Tree public int BTreeHeight(TreeNode node){ if(node==null){ return 0; }else{ int left=BTreeHeight(node.left); int right=BTreeHeight(node.right); if(left>right){ return left+1; }else{ return right+1; } } } }

Step [3]:-Now Create Main class For the Tree As below:-

package com.developerstechpoint.Tree; import java.util.Scanner; public class BinaryTreeDepth { /** * @author jeetendra * */ /* The DEPTH of a node is the number of EDGES from the node to the tree's root node. and DEPTH is SAME as LEVEL of TREE. The HEIGHT of a node is the number of NODES on the longest path from the node to a leaf. For example, when looking at the root node of the tree, the depth would be 0 and the height would be the number of nodes on the longest path to a leaf. * */ public static void main(String[] args) { System.out.println("Enter The Data to insert into rootnode=>"); Scanner sc=new Scanner(System.in); int d=sc.nextInt(); TreeNode rootnode = new TreeNode(d); System.out.println(rootnode.data ); BinaryTreeMethods binarytmethods=new BinaryTreeMethods(); System.out.println("Enter The Number Of Elements You want to insert in Tree"); int number = sc.nextInt(); int i=1; while(i<=number){ System.out.println("Enter data to insert in tree==="); int insertiondata=sc.nextInt(); binarytmethods.insertNode(rootnode,insertiondata); i++; } binarytmethods.inOrder(rootnode); System.out.println("Pre-Order========================"); binarytmethods.preOrder(rootnode); System.out.println("Post-Order========================"); binarytmethods.postOrder(rootnode); int height=binarytmethods.BTreeHeight(rootnode); System.out.println("Depth of Binary Tree is===>"+(height-1)); System.out.println("Height of Binary Tree is======>"+height); } } /*output:- * Enter The Data to insert into rootnode=> 8 8 Enter The Number Of Elements You want to insert in Tree 5 Enter data to insert in tree=== 1 Enter data to insert in tree=== 4 Enter data to insert in tree=== 9 Enter data to insert in tree=== 76 Enter data to insert in tree=== 5 1 4 5 8 9 76 Pre-Order======================== 8 1 4 5 9 76 Post-Order======================== 5 4 1 76 9 8 Depth of Binary Tree is=======>3 Height of Binary Tree is==========>4 */