Thread: BinarySearchTree Implementation
View Single Post
  #1 (permalink)  
Old 08-03-2007, 06:22 PM
HelloWorld's Avatar
HelloWorld HelloWorld is online now
PT Admin
Awards Showcase
Quality Tutorial 
Total Awards: 1
Join Date: Jun 2007
Location: In front of computer...
Posts: 1,118
iTrader: (0)
HelloWorld is a jewel in the roughHelloWorld is a jewel in the roughHelloWorld is a jewel in the rough
Icon9 BinarySearchTree Implementation
I'm currently working on my "Own" implementation for BinarySearchTree. I'm still trying to figure out how can I check each branch before getting into the programming part... Can anybody give me some suggestions on how should I implement the searching part?

I'm going to implement:
1. Insert
2. Remove

I'm still trying to design the insert part
for some reason it's getting complicated lol... I'm stucked into an endless loop...

__________________
PHP Code:
System.out.println("Hello World!"); 
Digg this Post! Del.Icio.Us this Post! Technorati this Post! Furl this Post! Mister Wong this Post! Newsvine this Post! Spurl this Post! Reddit this Post! Netscape this Post!
Reply With Quote