Win a copy of Functional Reactive Programming this week in the Other Languages forum!
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

Binary Tree Search

 
Nessa Student
Greenhorn
Posts: 1
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hello,

I am in CIS 275 at Devry Univ. for my lab project I am supposed to create a method to search through a binary tree ( if node == quarry return node location, if less than node move left and compare again, if greater than node move right and try again, if not found return null) but I have no idea how to create that in code, can someone please help me? (this project is due Saturday at midnight)

thank you all!

Nessa
 
Stefan Krompass
Ranch Hand
Posts: 75
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hi,

the implementation of search in binary trees is as simple as the description you have. Assume you have a binary tree which stores ints in nodes:

Then you can implement a method search:



Stefan
[ June 11, 2004: Message edited by: Stefan Krompass ]
 
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic