Discover
Questions library
Collections library
Find online teacher
login
Discover
questions library
Find online teacher
login
Introduction to Java Programming, Comprehensive Version (10th Edition)
by
Y. Danial liang
Edition:
10th edition
ISBN13:
978-0133761313
ISBN10:
0133761312
772
Java programming
Home
Books
Introduction to Java Programming, Comprehensive Version (10th Edition)
Similar Books
No books found
Title
Chapter: 24 /
Q: 15
(Test MyArrayList) Design and write a complete test program to test if the MyArrayList class in Listing 24.3 meets all requirements
Chapter: 24 /
Q: 16
(Test MyLinkedList) Design and write a complete test program to test if the MyLinkedList class in Listing 24.6 meets all requirements
Chapter: 25 /
Q: 1
(Add new methods in BST) Add the following new methods in BST
Chapter: 25 /
Q: 2
(Test full binary tree) A full binary tree is a binary tree with the leaves on the same level. Add a method in the BST class to return true if the tree is a full binary tree. (Hint: The number of nodes in a full binary tree is 2depth - 1.)
Chapter: 25 /
Q: 3
(Implement inorder traversal without using recursion) Implement the inorder method in BST using a stack instead of recursion. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the inorder method to display the elements
Chapter: 25 /
Q: 4
(Implement preorder traversal without using recursion) Implement the preorder method in BST using a stack instead of recursion. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the preorder method to display the elements
Chapter: 25 /
Q: 5
(Implement postorder traversal without using recursion) Implement the postorder method in BST using a stack instead of recursion. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the postorder method to display the elements
Chapter: 25 /
Q: 6
(Find the leaves) Add a method in the BST class to return the number of the leaves as follows:
Chapter: 25 /
Q: 7
(Find the nonleaves) Add a method in the BST class to return the number of the nonleaves as follows:
Chapter: 25 /
Q: 8
(Implement bidirectional iterator) The java.util.Iterator interface defines a forward iterator. The Java API also provides the java.util.ListIterator interface that defines a bidirectional iterator. Study ListIterator and define a bidirectional iterator for the BST class
total questions:
772
Previous
62
63
64
65
66
Next
Questions
772
Views
Best Answers
299
Points
5
×
Close
add reason
reason