Question

How to implement a simple Binary Tree in Java

Answer 1

class Node {
    int n;
    Node left, right;

    public Node(int item) {
        n = item;
        left = right = null;
    }
}

public class BinaryTree {
    Node root;
    
    public void printTree(Node node) {
        if (node != null) {
            printTree(node.left);
            System.out.print(node.n + " ");
            printTree(node.right);
        }
    }

    public static void main(String[] args) {
        BinaryTree btree = new BinaryTree();
    
        btree.root = new Node(1);
        btree.root.left = new Node(2);
        btree.root.right = new Node(3);
        btree.root.left.left = new Node(4);
        btree.root.right.right = new Node(5);
    
        btree.printTree(btree.root);
    }
}



  
/*
        1
    2       3
4               5

*/
  
  
/*
run:
    
4 2 1 3 5 
 
*/

 

70+ SQL courses for beginners and professionals