Search:

it's first option about swap root with an node..
but how to do it? i have no clue..

and here is my node class:




public class BinaryTreeNode<T>
{

here the code:


public class LinkedBinarySearchTree<T> extends LinkedBinaryTree<T> implements
BinarySearchTreeADT<T> {

BinaryTreeNode<T> newParent = null;

public...

hey guys..

i need ideas or algorithms for implementing a special version of binary search tree..

the tree is an normal binary seatch tree, where left is smaller than right node.
but each node...