Schaum's Outline of Data Structures with Java
McGraw Hill Professional, 8 de des. 2000 - 369 pàgines
• Scores of problems and examples—which will be available on the Internet after publication—simplify and demonstrate central concepts and help users develop their expertise in handling data structures in Java
• Java is today’s fastest growing programming language, with broad popular appeal for its ease of use in creating websites and its functioning capability on any platform
• Topics cover all the material in the first- or second-year course required of all Computer Science majors
Què en diuen els usuaris - Escriviu una ressenya
No hem trobat cap ressenya als llocs habituals.
Altres edicions - Mostra-ho tot
abstract algorithm args array basis Binary Search binary tree BinaryTree capacity char Collection complete component computed contains correct defined definition disk from peg double edge elements empty equal Example expression false field function given graph heap height implementation Insertion int i=0 integer interface iterator Java length ListIterator loop means method Move node Note null Object object operator path Point prime private static Problem Proof public boolean public public class public int public Object public static void public void queue random recursive reference remove root sequence server shown shows solution Sort stack static int static void main(String step stored String structure subtree System.out.print Theorem traversal vector vertex visits Write
Pàgina 40 - It states that every even number greater than 2 is the sum of two primes in at least one way.
Pàgina 170 - The path length of a tree is the sum of the lengths of all paths from its root.
Pàgina 312 - A digraph is strongly connected if there is a path between every pair of vertices. A digraph is weakly connected if its embedded graph is connected.
Pàgina 304 - A complete graph is a simple graph in which every pair of vertices is connected by an edge.
Pàgina 170 - The depth of a node in a tree is the length of its root path.
Pàgina 218 - Define the balance number at any node to be the difference between the height of its left subtree and the height of its right subtree.
Pàgina 84 - The objective of the game is to move all the disks from peg A to peg C, one disk at a time, without violating the rule.
Pàgina 304 - The degree (or valence) of a vertex is the number of edges that are incident upon it.