Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!mips!wrdis01!nstn.ns.ca!cs.dal.ca!husky1.stmarys.ca!gen0030
From: gen0030@husky1.stmarys.ca
Newsgroups: comp.lang.pascal
Subject: <None>
Message-ID: <1991Apr11.204820.1@husky1.stmarys.ca>
Date: 11 Apr 91 23:48:20 GMT
Sender: news@cs.dal.ca (USENET News)
Organization: Math, Stats & CS, Dalhousie University, Halifax, NS, Canada
Lines: 10
Nntp-Posting-Host: husky1.stmarys.ca


 Help ! I am trying to do an assingment using random access file, building a
B-Tree into the file.. in other words, instead of pointers, the program needs to
have file component numbers for each node of the B-Tree. The problem we are
having is that we cannot figure out how to handle the splitting of nodes
without screwing up the component numbers.....  Also, we cannot allocate x
amount of memory so that each node has the max number of possible nodes
because we have a liited amount of storage space.
	Any suggestions, comments, etc. would be appreciated !
		thanks.