Programming Forums - View Single Post - Implementat of B-Tree

tmac_619 · Feb 22nd, 2008, 8:23 PM

I am currently working on a B-Tree implementation.
I am working on the Insert Function. I just have a quick question. When you are suppose to insert something in the tree, you have to run a search. And in order to search you need to compare objects. How are we suppose to compare..? Compare the address, pointer or any other thing ?.

Thanks,

Feb 22nd, 2008, 8:23 PM	#1
tmac_619 Newbie Join Date: Feb 2008 Posts: 4 Rep Power: 0	Implementat of B-Tree I am currently working on a B-Tree implementation. I am working on the Insert Function. I just have a quick question. When you are suppose to insert something in the tree, you have to run a search. And in order to search you need to compare objects. How are we suppose to compare..? Compare the address, pointer or any other thing ?. Thanks,