public void insertNode(Node root, Node newNode) { Node temp; temp = root; if (newNode.data < temp.data) { if (temp.left == null) { temp.left = newNode; } else { temp = temp.left; insertNode(temp, newNode); } } else if (newNode.data > temp.data) { if (temp.right == null) { temp.right = newNode; } else { temp = temp.right; insertNode(temp, newNode); } } }
public void displayTree(Node root) { Node temp; temp = root; if (temp == null) return; displayTree(temp.left); System.Console.Write(temp.data + " "); displayTree(temp.right); }
public Node addNode(int data) { Node newNode = new Node(data); if (root == null) { root = newNode; } count++; return newNode; }
public BinaryTreeImp() { root = null; }
public Node(int data) { this.data = data; left = null; right = null; }