Binary Search Tree

Min to Max values algorithm

Page 1 of 1

0 Replies - 1002 Views - Last Post: 23 September 2008 - 07:34 PM Rate Topic: -----

#1 morgazzim  Icon User is offline

  • New D.I.C Head

Reputation: 0
  • View blog
  • Posts: 1
  • Joined: 23-September 08

Binary Search Tree

Posted 23 September 2008 - 07:34 PM

Hi im creating a Binary search tree and i want a method that returns values equal to and between the min and max values given from within the tree, returned as a list. this is the method as i have recieved it but i have no idea where to start as im only new to programming. if someone could sort of psuedocode the sort of procedure i would have to go through that would be awsum!
Cheers Morgan

	/**
	 *  Gets the list of values with key in the
	 *  range [rangeMin, rangeMax].
	 * 
	 * @param rangeMin minimum value of a range.
	 * @param rangeMax maximum value of a range.
	 * @return a list of values.
	 */
	public List<V> getValues(K rangeMin, K rangeMax)
	{
		return null;
	}



Is This A Good Question/Topic? 0
  • +

Page 1 of 1