خطوات الــ insearch binary tree و search binary tree

import java.util.Stack;

public class IterativeBST
{

Node m_root;

public void insertBST(int data)
{
if (m_root == null)
{
m_root = new Node(data, null, null);
return;
}
Node root = m_root;
while (root != null)
// Not the same value twice
if (data == root.data)
return;
else if (data < root.data)
// insert left
if (root.left == null)
{
root.left = new Node(data, null, null);
return;
} else
root = root.left;
else // insert right
if (root.right == null)
{
root.right = new Node(data, null, null);
return;
} else
root = root.right;
}

public Node searchBST(int key)
{
Node next = m_root;

while (next != null)
if (key == next.data)
return next;
else if (key < next.data)
next = next.left;
else
next = next.right;


return null;
}

//calls the method to do in order
public void print_inorderBST()
{
inorder(m_root);
}

private void inorder(Node node)
{
//incoming node is root
Stack<Node> nodes = new Stack<Node>();
while (!nodes.isEmpty() || null != node)
if (null != node)
{
nodes.push(node);
node = node.left;
} else
{
node = nodes.pop();
System.out.println(node.data);
node = node.right;
}
}
}

public class RecursiveBST
{

Node m_root;

public void insertBST(int data)
{
if (m_root == null)
m_root = new Node(data, null, null);
else
insert(m_root, data);
}

private void insert(Node node, int data)
{
// Not the same value twice
if (data == node.data)
return;
else if (data < node.data)
if (node.left == null)
node.left = new Node(data, null, null);
else
insert(node.left, data);
else if (node.right == null)
node.right = new Node(data, null, null);
else
insert(node.right, data);
}

public Node searchBST(int key)
{
return search(m_root, key);
}

private Node search(Node node, int key)
{
if (node == null)
return null;

if (node.data == key)
return node;

if (key < node.data)
return search(node.left, key);
else
return search(node.right, key);
}

//calls the method to do in order
public void print_inorderBST()
{
inorder(m_root);
}

// ------------------ InOrder traversal-------------------
private void inorder(Node theRootNode)
{
if (theRootNode != null)
{
inorder(theRootNode.left);
System.out.println(theRootNode.data + " , ");
inorder(theRootNode.right);
}
}
}

public class TreeTest
{
public static void main(String[] args)
{
int[] data = new int[] {20 , 3, 55, 7, 43 , 100 , 9};
RecursiveBST recursiveBST = new RecursiveBST();
IterativeBST iterativeBST = new IterativeBST();

for(int i = 0 ; i < data.length ; i ++)
{
recursiveBST.insertBST(data);
iterativeBST.insertBST(data);
}

if(recursiveBST.searchBST(43) != null)
System.out.println("Found in recursiveBST.");

if(iterativeBST.searchBST(43) != null)
System.out.println("Found in iterativeBST.");

System.out.println("recursiveBST Data :");
recursiveBST.print_inorderBST();

System.out.println("iterativeBST Data :");
iterativeBST.print_inorderBST();

}

}