49 lines
2.5 KiB
Plaintext
49 lines
2.5 KiB
Plaintext
#BlueJ class context
|
|
comment0.target=Trees
|
|
comment0.text=\r\n\ Eine\ Sammlung\ von\ Klassenmethoden,\ um\ wiederkehrende\r\n\ Aufgaben\ mit\ bin\u00E4ren\ B\u00E4umen\ zu\ vereinfachen.\r\n\ @version\ 0.1\ (2019-09-13)\r\n\ @author\ J.\ Neugebauer\ <schule@neugebauer.cc>\r\n
|
|
comment1.params=pRoot
|
|
comment1.target=int\ getMaxDepth(BinaryTree)
|
|
comment10.params=pRoot\ pOut
|
|
comment10.target=void\ printPostorder(BinaryTree,\ java.io.PrintStream)
|
|
comment11.params=pRoot
|
|
comment11.target=void\ printInorder(BinaryTree)
|
|
comment12.params=pRoot\ pOut
|
|
comment12.target=void\ printInorder(BinaryTree,\ java.io.PrintStream)
|
|
comment13.params=pNodeCount\ pMinValue\ pMaxValue
|
|
comment13.target=BinaryTree\ generateBalancedIntegerTree(int,\ int,\ int)
|
|
comment14.params=pDepth\ pMinValue\ pMaxValue
|
|
comment14.target=BinaryTree\ generateCompleteIntegerTree(int,\ int,\ int)
|
|
comment15.params=pNodeCount\ pWeight\ pUncertainty
|
|
comment15.target=BinaryTree\ generateIntegerTree(int,\ double,\ double)
|
|
comment16.params=pNodeCount\ pMinValue\ pMaxValue\ pWeight\ pUncertainty
|
|
comment16.target=BinaryTree\ generateIntegerTree(int,\ int,\ int,\ double,\ double)
|
|
comment17.params=
|
|
comment17.target=java.lang.Integer\ call()
|
|
comment18.params=pNodeCount\ pWeight\ pUncertainty
|
|
comment18.target=BinaryTree\ generateStringTree(int,\ double,\ double)
|
|
comment19.params=pNodeCount\ pWords\ pWeight\ pUncertainty
|
|
comment19.target=BinaryTree\ generateStringTree(int,\ java.lang.String[],\ double,\ double)
|
|
comment2.params=pRoot
|
|
comment2.target=int\ countNodes(BinaryTree)
|
|
comment20.params=
|
|
comment20.target=java.lang.String\ call()
|
|
comment21.params=pNodeCount\ pGenerator\ pWeight\ pUncertainty
|
|
comment21.target=BinaryTree\ generateTree(int,\ java.util.concurrent.Callable,\ double,\ double)
|
|
comment22.params=pRoot\ pNodeCount\ pGenerator\ pWeight\ pUncertainty
|
|
comment22.target=BinaryTree\ generateTree(BinaryTree,\ int,\ java.util.concurrent.Callable,\ double,\ double)
|
|
comment3.params=pRoot
|
|
comment3.target=int\ countLeaves(BinaryTree)
|
|
comment4.params=pRoot
|
|
comment4.target=void\ printPretty(BinaryTree)
|
|
comment5.params=pRoot\ pOut
|
|
comment5.target=void\ printPretty(BinaryTree,\ java.io.PrintStream)
|
|
comment6.params=pRoot\ prefix\ isTail\ sb
|
|
comment6.target=java.lang.StringBuilder\ printPretty(BinaryTree,\ java.lang.StringBuilder,\ boolean,\ java.lang.StringBuilder)
|
|
comment7.params=pRoot
|
|
comment7.target=void\ printPreorder(BinaryTree)
|
|
comment8.params=pRoot\ pOut
|
|
comment8.target=void\ printPreorder(BinaryTree,\ java.io.PrintStream)
|
|
comment9.params=pRoot
|
|
comment9.target=void\ printPostorder(BinaryTree)
|
|
numComments=23
|