code fragments.mht

经典的数据结构源代码（java 实现）

r.html">3.23=20
  DList-Trailer</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch03/Java/DList-Conv.h=
tml">3.24=20
  DList-Conv</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch03/Java/CircleList-C=
ircle.html">3.25=20
  CircleList-Circle</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch03/Java/CircleList-D=
uck.html">3.26=20
  CircleList-Duck</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch03/Java/GenericSort-=
Sort.html">3.28=20
  GenericSort-Sort</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch03/Java/Factorial-Re=
cursive.html">3.29=20
  Factorial-Recursive</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch03/Java/Ruler-Ruler.=
html">3.30=20
  Ruler-Ruler</A></LI></UL>
<H3>Chapter 5: Stacks and Queues</H3>
<UL>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/EmptyStackEx=
ception-EmptyStackException.html">5.1=20
  EmptyStackException-EmptyStackException</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/Stack-Stack.=
html">5.2=20
  Stack-Stack</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/ArrayStack-A=
rrayStack.html">5.4=20
  ArrayStack-ArrayStack</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/ArrayStack-A=
rrayStack2.html">5.5=20
  ArrayStack-ArrayStack2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/Node-Node.ht=
ml">5.6=20
  Node-Node</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/NodeStack-No=
deStack.html">5.7=20
  NodeStack-NodeStack</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/StackExample=
s-reverse.html">5.8=20
  StackExamples-reverse</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/StackExample=
s-main.html">5.9=20
  StackExamples-main</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/HTML-HTML.ht=
ml">5.11=20
  HTML-HTML</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/HTML-HTML2.h=
tml">5.12=20
  HTML-HTML2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/Queue-Queue.=
html">5.13=20
  Queue-Queue</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/NodeQueue-en=
queue.html">5.15=20
  NodeQueue-enqueue</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/NodeQueue-de=
queue.html">5.15=20
  NodeQueue-dequeue</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/Josephus-Jos=
ephus.html">5.16=20
  Josephus-Josephus</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/Deque-Deque.=
html">5.17=20
  Deque-Deque</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/NodeDeque-No=
deDeque.html">5.18=20
  NodeDeque-NodeDeque</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/NodeDeque-si=
ze.html">5.18=20
  NodeDeque-size</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/NodeDeque-is=
Empty.html">5.18=20
  NodeDeque-isEmpty</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/NodeDeque-fi=
rst.html">5.18=20
  NodeDeque-first</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/NodeDeque-ad=
dFirst.html">5.18=20
  NodeDeque-addFirst</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/NodeDeque-re=
moveLast.html">5.18=20
  NodeDeque-removeLast</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch04/Java/NodeDeque-ta=
il.html">5.18=20
  NodeDeque-tail</A></LI></UL>
<H3>Chapter 6: Lists and Iterators</H3>
<UL>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/IndexList-He=
ader.html">6.2=20
  IndexList-Header</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/IndexList-Li=
st.html">6.2=20
  IndexList-List</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/IndexList-Ta=
il.html">6.2=20
  IndexList-Tail</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/ArrayIndexLi=
st-vector.html">6.3=20
  ArrayIndexList-vector</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/Position-All=
.html">6.4=20
  Position-All</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/IterablePosi=
tionList-Header.html">6.5=20
  IterablePositionList-Header</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-List.html">6.5=20
  PositionList-List</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-Tail.html">6.5=20
  PositionList-Tail</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/DNode-DNode.=
html">6.6=20
  DNode-DNode</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/NodePosition=
List-Header.html">6.9=20
  NodePositionList-Header</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/NodePosition=
List-Listvars.html">6.9=20
  NodePositionList-Listvars</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/NodePosition=
List-checkPosition.html">6.9=20
  NodePositionList-checkPosition</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/NodePosition=
List-first.html">6.10=20
  NodePositionList-first</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/NodePosition=
List-remove.html">6.11=20
  NodePositionList-remove</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-Header.html">6.12=20
  PositionList-Header</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/IterablePosi=
tionList-Filler.html">6.12=20
  IterablePositionList-Filler</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-Iterator.html">6.12=20
  PositionList-Iterator</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-Tail.html">6.12=20
  PositionList-Tail</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/NodePosition=
List-toString.html">6.13=20
  NodePositionList-toString</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/ForEach-Fore=
ach.html">6.14=20
  ForEach-Foreach</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/ForEach-arra=
y.html">6.14=20
  ForEach-array</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/ElementItera=
tor-Iterator.html">6.14=20
  ElementIterator-Iterator</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/NodePosition=
List-Iterator.html">6.15=20
  NodePositionList-Iterator</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-Header.html">6.16=20
  PositionList-Header</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/IterablePosi=
tionList-Filler.html">6.16=20
  IterablePositionList-Filler</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-Positions.html">6.16=20
  PositionList-Positions</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-Tail.html">6.16=20
  PositionList-Tail</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/NodePosition=
List-PIterator.html">6.17=20
  NodePositionList-PIterator</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/Sequence-Seq=
uence.html">6.18=20
  Sequence-Sequence</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/FavoriteList=
-Favorites.html">6.19=20
  FavoriteList-Favorites</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/FavoriteList=
-More.html">6.20=20
  FavoriteList-More</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/FavoriteList=
-Entry.html">6.20=20
  FavoriteList-Entry</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/FavoriteList=
MTF-Favorites.html">6.21=20
  FavoriteListMTF-Favorites</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/FavoriteTest=
er-Tester.html">6.22=20
  FavoriteTester-Tester</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-Header.html">A.3=20
  PositionList-Header</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/IterablePosi=
tionList-Filler.html">A.3=20
  IterablePositionList-Filler</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-Iterator.html">A.3=20
  PositionList-Iterator</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/PositionList=
-Tail.html">A.3=20
  PositionList-Tail</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/NodePosition=
List-toString.html">A.4=20
  NodePositionList-toString</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/ForEach-Fore=
ach.html">A.5=20
  ForEach-Foreach</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch05/Java/ForEach-arra=
y.html">A.5=20
  ForEach-array</A></LI></UL>
<H3>Chapter 7: Trees</H3>
<UL>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/Tree-Tree.ht=
ml">7.1=20
  Tree-Tree</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/Trees-depth.=
html">7.3=20
  Trees-depth</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/Trees-height=
1.html">7.5=20
  Trees-height1</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/Trees-height=
2.html">7.7=20
  Trees-height2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/Trees-preord=
erPrint.html">7.9=20
  Trees-preorderPrint</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/Trees-parent=
heticRepresentation.html">7.10=20
  Trees-parentheticRepresentation</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/Trees-postor=
derPrint.html">7.12=20
  Trees-postorderPrint</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/Trees-diskSp=
ace.html">7.13=20
  Trees-diskSpace</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/BinaryTree-T=
ree.html">7.14=20
  BinaryTree-Tree</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/BTNode-BTNod=
e.html">7.15=20
  BTNode-BTNode</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/LinkedBinary=
Tree-LinkedBinaryTree.html">7.16=20
  LinkedBinaryTree-LinkedBinaryTree</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/LinkedBinary=
Tree-LinkedBinaryTree2.html">7.17=20
  LinkedBinaryTree-LinkedBinaryTree2</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/LinkedBinary=
Tree-LinkedBinaryTree3.html">7.18=20
  LinkedBinaryTree-LinkedBinaryTree3</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/LinkedBinary=
Tree-LinkedBinaryTree4.html">7.19=20
  LinkedBinaryTree-LinkedBinaryTree4</A>
  <LI><A=20
  =
href=3D"http://ww0.java4.datastructures.net/source/ch06/Java/LinkedBinary=
Tree-LinkedBinaryTree5.html">7.20=20
  LinkedBinaryTree-LinkedBinaryTree5</A>