Data Structures and Algorithms Discussion Board
February 04, 2012, 10:32:37 AM *
Welcome, Guest. Please login or register.
Login with username, password and session length
News: Looking for a reliable webhosting provider? Read HostGator review to find 7 arguments in support of HostGator.
 
   Home   Help Search Login Register  
Data Structures and Algorithms Discussion Board > Data Structures, Algorithms, Java and C++ > Data Structures & Algorithms > binary search tree>intervals
Pages: [1]
« previous next »
  Print  
Author Topic: binary search tree>intervals  (Read 4275 times)
kaso
Newbie
*

Rating: 0
Offline Offline

Posts: 3
« on: May 19, 2009, 04:46:56 AM »
what do the intervals represent in a binary search tree?
Logged
Algolist.net Editor
Administrator
Newbie
*****

Rating: 0
Offline Offline

Posts: 8
« Reply #1 on: May 21, 2009, 02:35:26 AM »
Could you please explain, what do you mean by intervals?
Logged
kaso
Newbie
*

Rating: 0
Offline Offline

Posts: 3
« Reply #2 on: May 21, 2009, 01:13:14 PM »
when we use  the search binary trees ,we store the keys in the internal nodes...and the leaves represent intervals.....so  what are these intervals?
I couldn't understand...
Logged
Denis
Newbie
*

Rating: 0
Offline Offline

Posts: 21
« Reply #3 on: May 22, 2009, 04:01:33 AM »
Did you saw this on the site or somewhere else? Because you may talking about interval trees.
« Last Edit: November 21, 2009, 04:23:55 AM by Algolist.net Editor » Logged
kaso
Newbie
*

Rating: 0
Offline Offline

Posts: 3
« Reply #4 on: May 22, 2009, 07:14:49 AM »
NO not in the site,
when we need to search in a binary tree ,we store the nodes in two ways :
the first is called binary trees ..the keys are stored in the internal nodes and the leaves represent intervals..
the second way (leaf search tress) is to store the keys in the leaves ..and the internal nodes is just  to direct ....
Logged
Pages: [1]
  Print  
« previous next »
 
Jump to: