A binary tree is a data structure in which each node has at most two children.
To implement a binary tree, let's first define a node class to will represent a single node in the tree. Each node can have left and right nodes, so we will have left & right pointers in the class:
<![CDATA[
class Node {
int data;
Node left, right;
public Node(int item) {
data = item;
left = right = null;
}
}]]>
Now we can start creating our tree:
<![CDATA[
class BinaryTree {
class Node {
int data;
Node left, right;
public Node(int item) {
data = item;
left = right = null;
}
}
Node root;
BinaryTree() {
root = null;
}
void insert(int data);
}
]]>
Full Program:
<![CDATA[import java.util.Random;
class BinaryTree {
class Node {
int data;
Node left, right;
public Node(int item) {
data = item;
left = right = null;
}
}
Node root;
BinaryTree() {
root = null;
}
void insert(int data) {
root = recInsert(root, data);
}
Node recInsert(Node root, int data) {
Random rn = new Random();
int rand = rn.nextInt() % 2;
if (root == null) {
root = new Node(data);
return root;
}
if (rand == 0)
root.left = recInsert(root.left, data);
else
root.right = recInsert(root.right, data);
return root;
}
void print(Node root, int space, int t) {
int COUNT = 3;
if(root == null)
return;
space += COUNT;
print(root.right, space, 1);
for(int i = COUNT; i < space; i++) {
System.out.print(" ");
}
if(t == 1) {
System.out.println("/ " + root.data);
}
else if (t == 2) {
System.out.println("\\ " + root.data);
}else{
System.out.println(root.data);
}
print(root.left, space, 2);
}
public static void main(String[] args) {
BinaryTree t = new BinaryTree();
t.insert(5);
t.insert(3);
t.insert(8);
t.insert(1);
t.insert(4);
t.insert(7);
t.insert(9);
t.insert(0);
t.insert(2);
t.insert(6);
t.insert(10);
t.print(t.root, 0, 0);
}
}]]>
You might be interested in this too.:
4 Upvotes
0 Downvotes