AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.BinarySearchTree.Iterator Class Reference

inorder iterator More...

+ Inheritance diagram for aud.BinarySearchTree.Iterator:
+ Collaboration diagram for aud.BinarySearchTree.Iterator:

Public Member Functions

boolean hasNext ()
 
Cursor next ()
 
void remove ()
 not implemented More...
 

Detailed Description

inorder iterator

See also
BinarySearchTree

Definition at line 411 of file BinarySearchTree.java.

Member Function Documentation

◆ hasNext()

boolean aud.BinarySearchTree.Iterator.hasNext ( )

Definition at line 419 of file BinarySearchTree.java.

419 {
420 return iter_!=null && iter_.hasNext();
421 }

◆ next()

Cursor aud.BinarySearchTree.Iterator.next ( )

Definition at line 423 of file BinarySearchTree.java.

423 {
424 Node node=(Node) iter_.next();
425 return new Cursor(node);
426 }

◆ remove()

void aud.BinarySearchTree.Iterator.remove ( )

not implemented

Exceptions
UnsupportedOperationException

Definition at line 430 of file BinarySearchTree.java.

430 {
431 throw new UnsupportedOperationException();
432 }

The documentation for this class was generated from the following file: