The BSTElement class is the building block for creating binary search trees. More...

Inheritance diagram for bridges.base.BSTElement< K, E >:

Public Member Functions
	BSTElement ()

	BSTElement (E e, BSTElement< K, E > left, BSTElement< K, E > right)

	BSTElement (K key, E e, BSTElement< K, E > left, BSTElement< K, E > right)

	BSTElement (E e)

String	getDataStructType ()

	BSTElement (K key, E e)

	BSTElement (String label, E e)

	BSTElement (String label, K key, E e)

	BSTElement (BSTElement< K, E > left, BSTElement< K, E > right)

K	getKey ()

void	setKey (K key)

BSTElement< K, E >	getLeft ()

BSTElement< K, E >	getRight ()

Public Member Functions inherited from bridges.base.BinTreeElement< E >
	BinTreeElement ()

	BinTreeElement (E e)

	BinTreeElement (String label, E e)

	BinTreeElement (BinTreeElement< E > left, BinTreeElement< E > right)

	BinTreeElement (E e, BinTreeElement< E > left, BinTreeElement< E > right)

String	getDataStructType ()

BinTreeElement< E >	getLeft ()

void	setLeft (BinTreeElement< E > left)

BinTreeElement< E >	getRight ()

void	setRight (BinTreeElement< E > right)

Public Member Functions inherited from bridges.base.TreeElement< E >
	TreeElement ()

	TreeElement (E e)

	TreeElement (String label, E e)

	TreeElement (TreeElement< E > left, TreeElement< E > right)

	TreeElement (E e, TreeElement< E > left, TreeElement< E > right)

String	getDataStructType ()

void	addChild (TreeElement< E > child)

int	getNumberOfChildren ()

void	setChild (int index, TreeElement< E > child)

TreeElement< E >	getChild (int index)

String	getDataStructureRepresentation ()

Public Member Functions inherited from bridges.base.Element< E >
String	getDataStructType ()

	Element ()

	Element (E val)

	Element (String label, E val)

	Element (Element< E > original)

String	getIdentifier ()

ElementVisualizer	getVisualizer ()

void	setVisualizer (ElementVisualizer visualizer)

LinkVisualizer	getLinkVisualizer (Element< E > el)

String	getClassName ()

int	compareTo (Element< E > e1)

boolean	equals (Element< E > e1)

String	getElementRepresentation ()

String	getLinkRepresentation (LinkVisualizer lv, String src, String dest)

String	getLabel ()

void	setLabel (String label)

String	arrangeLabel (String label, int wordNumber)

E	getValue ()

void	setValue (E value)

String	toString ()

Public Member Functions inherited from bridges.base.DataStruct
abstract String	getDataStructType ()

Additional Inherited Members
Protected Member Functions inherited from bridges.base.Element< E >
void	setLinkVisualizer (Element< E > el)

void	removeLinkVisualizer (Element< E > el)

void	validateVal (E value)

Protected Attributes inherited from bridges.base.DataStruct
String	QUOTE = "\""

Detailed Description

The BSTElement class is the building block for creating binary search trees.

The BSTElement class is the building block for creating binary search tree structures. It contains two children (viz., left, right), and a search key, to be used in search operations .

BSTElement contains a visualizer (ElementVisualizer) object for setting visual attributes (color, shape, opacity, size), necessary for displaying them in a web browser.

BST Elements also have a LinkVisualizer object, that is used when they are linked to another element, appropriate for setting link attributes, for instance, between the current element and its left or right child

Parameters

E	he generic parameter object that is part of this element, representing application specific data.
K	is the search key parameter in the BST node; K must be orderable, such as integer, float, string, etc., on which relational operators work.

Author: Kalpathi Subramanian, Mihai Mehedint

Date: 6/22/16, 1/7/17, 5/17/17

This class extends the BinTreeElement class by adding a 'key' value for use in a binary search tree implementations.

See also: Example tutorial using BSTElement at
http://bridgesuncc.github.io/Hello_World_Tutorials/BST.html

Constructor & Destructor Documentation

bridges.base.BSTElement< K, E >.BSTElement ( )

Construct an empty BSTElement with no key assigned and left and right pointers set to null.

bridges.base.BSTElement< K, E >.BSTElement	(	E	e,
		BSTElement< K, E >	left,
		BSTElement< K, E >	right
	)

Construct a BSTElement holding an object "e" with a left pointer assigned to "left" and a right pointer assigned to "right".

Parameters

e	the object that BSTElement is holding
left	the BSTElement that should be assigned to the left pointer
right	the BSTElemetn taht should be assigned to the right pointer

bridges.base.BSTElement< K, E >.BSTElement	(	K	key,
		E	e,
		BSTElement< K, E >	left,
		BSTElement< K, E >	right
	)

Construct a BSTElement with a key "key", holding an object "e" with a left pointer assigned to "left" and a right pointer assigned to "right".

Parameters

key	the key to be used in a binary search tree implementation
e	the object this BSTElement is holding
left	the BSTElement that should be assigned to the left pointer
right	the BSTElement that should be assigned to the right pointer

bridges.base.BSTElement< K, E >.BSTElement ( E e )

Construct a BSTElement holding the object "e", with no key assigned and left and right pointers set to null.

Parameters

e	the object this BSTElement is holding

bridges.base.BSTElement< K, E >.BSTElement	(	K	key,
		E	e
	)

Construct a BSTElement holding the object "e", with key "key" assigned and left and right pointers set to null.

Parameters

key	the key to be used in a binary search tree implementation
e	the object this BSTElement is holding

bridges.base.BSTElement< K, E >.BSTElement	(	String	label,
		E	e
	)

Construct a BSTElement holding the object "e", with label set to "label", with no key assigned, and left and right pointers set to null.

Parameters

label	the label of BSTElement that shows up on the Bridges visualization
e	the object this BSTElement is holding

bridges.base.BSTElement< K, E >.BSTElement	(	String	label,
		K	key,
		E	e
	)

Construct a BSTElement holding the object "e", with label set to "label", with "key" assigned to key, and left and right pointers set to null.

Parameters

label	the label of BSTElement that shows up on the Bridges visualization
key	the key to be used in a binary search tree implementation
e	the object this BSTElement is holding

bridges.base.BSTElement< K, E >.BSTElement	(	BSTElement< K, E >	left,
		BSTElement< K, E >	right
	)

Construct an empty BSTElement, with no key assigned, and left and right pointers set to null.

Parameters

left	the BSTElement that should be assigned to the left pointer
right	the BSTElement that should be assigned to the right pointer

Member Function Documentation

String bridges.base.BSTElement< K, E >.getDataStructType ( )

This method gets the data structure type

Returns: The date structure type as a string

K bridges.base.BSTElement< K, E >.getKey ( )

Return the key of the BSTElement

Returns: the key of this BSTElement

BSTElement<K, E> bridges.base.BSTElement< K, E >.getLeft ( )

BSTElement<K, E> bridges.base.BSTElement< K, E >.getRight ( )

void bridges.base.BSTElement< K, E >.setKey ( K key )

Set the key of the BSTElement to key

Parameters

key	the key to set

The documentation for this class was generated from the following file:

/Users/kalpathi/gr/bridges/bridges17/java/src/main/java/bridges/base/BSTElement.java

Public Member Functions

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation