Relative Content

Tag Archive for javabinary-treeinorderpreorderpostorder

Implementation of Traversal of BInary Tree in java

public void inOrder(Node1 node) { if(node != null) { inOrder(node.left); node.displayData(); inOrder(node.right); } } public void preOrder(Node1 node) { if(node =! null){ node.displayData(); preOrder(node.left); preOrder(node.right); } } public void postOrder(Node1 node) { if(node != null) { postOrder(node.left); postOrder(node.right); node.displayData(); } } public static void main(String[] agrs) { traversal bst = new traversel(); bst.insert(25); bst,insert(10); bst.insert(15); […]