• private void splay( IPosition<T> p ) – splay a position in the tree. • public void insert( T value ) – insert a value into the splay tree. • public void remove( T value ) – remove a value from the splay tree. • public boolean contains( T value ) – check to s...
but when they face questions about a tree, like the difference between binary tree and binary search tree, or the difference between binary search tree and a self-balanced tree-like AVL tree or Red-Black tree, they become speechless.
• private void splay( IPosition<T> p ) – splay a position in the tree. • public void insert( T value ) – insert a value into the splay tree. • public void remove( T value ) – remove a value from the splay tree. • public boolean contains( T value ) – check to s...