John

• Mar 15th, 2005

 

This article introduces the basic concepts of binary trees, and then works through a series of practice problems with solution code in C/C++ and Java. Binary trees have an elegant recursive pointer structure, so they are a good way to learn recursive pointer algorithms. http://cslibrary.stanford.edu/110/BinaryTrees.html

RAAJKUMAR.S

• May 18th, 2017

 

This is the code for binary tree in java

Code
public class bTree {


bnode root=null;


 


void add(int val){


    bnode newnode= new bnode(val);


    bnode curr = this.root;


    bnode parent = null;


 


    if(this.root == null){


        this.root = newnode;


        System.out.println("Inserted at root    "+newnode.value);


    }


    else{


            while( curr != null){


            System.out.println("Current Left and Right  "+curr.left+"   "+curr.right);


 


            if(curr.left == null){


                curr =  curr.left;


                curr = newnode;


                System.out.println("Inserted Left       " +newnode.value);


                return;


            }


            if(curr.right ==  null){


                curr =  curr.right;


                curr = newnode;


                System.out.println("Inserted Right      " +newnode.value);


                return;


            }


        }


    }


}