Week 7 Use and Search of Trees

1/27/2003

CS2 Week 7

Searching Binary Tree

private TreeNode search( TreeNode ptr, TreeData key) {

if ( ptr==null ) return null;

else

if ( ptr.data.equals(key) ) return ptr;

else

if ( key.compareTo(ptr.data) < 0 ) return search( ptr.left, key);

else return search( ptr.right, key);

}

public boolean includes( TreeData key ) {

return (search( root, key ) != null );

}