book

Data Structures and Algorithms in Java, 2nd Edition

Name: Data Structures and Algorithms in Java, 2nd Edition
Author: Robert Lafore
ISBN: 9780134849775

by Robert Lafore

September 2017

Intermediate to advanced

800 pages

23h 19m

English

Sams

Read now

Unlock full access

Title Page
Copyright Page
Contents at a Glance
Table of Contents
About the Author
Dedication Page
Acknowledgments to the First Edition
Acknowledgments to the Second Edition
We Want to Hear from You!
Introduction
What’s New in the Second EditionAdditional TopicsEnd-of-Chapter QuestionsExperimentsProgramming ProjectsWhat This Book Is AboutWhat’s Different About This BookEasy to UnderstandWorkshop AppletsJava Example CodeWho This Book Is ForWhat You Need to Know Before You Read This BookThe Software You Need to Use This BookHow This Book Is OrganizedEnjoy Yourself!

1 Overview
What Are Data Structures and Algorithms Good For?Real-World Data StorageProgrammer’s ToolsReal-World ModelingOverview of Data StructuresOverview of AlgorithmsSome DefinitionsDatabaseRecordFieldKeyObject-Oriented ProgrammingProblems with Procedural LanguagesObjects in a NutshellA Runnable Object-Oriented ProgramInheritance and PolymorphismSoftware EngineeringJava for C++ ProgrammersNo PointersOverloaded OperatorsPrimitive Variable TypesInput/OutputJava Library Data StructuresSummaryQuestions
2 Arrays
The Array Workshop AppletInsertionSearchingDeletionThe Duplicates IssueNot Too SwiftThe Basics of Arrays in JavaCreating an ArrayAccessing Array ElementsInitializationAn Array ExampleDividing a Program into ClassesClasses LowArray and LowArrayAppClass InterfacesNot So ConvenientWho’s Responsible for What?The highArray.java ExampleThe User’s Life Made EasierAbstractionThe Ordered Workshop AppletLinear SearchBinary SearchJava Code for an Ordered ArrayBinary Search with the find() MethodThe OrdArray ClassAdvantages of Ordered ArraysLogarithmsThe EquationThe Opposite of Raising Two to a PowerStoring ObjectsThe Person ClassThe classDataArray.java ProgramBig O NotationInsertion in an Unordered Array: ConstantLinear Search: Proportional to NBinary Search: Proportional to log(N)Don’t Need the ConstantWhy Not Use Arrays for Everything?SummaryQuestionsExperimentsProgramming Projects
3 Simple Sorting
How Would You Do It?Bubble SortBubble Sort on the Baseball PlayersThe BubbleSort Workshop AppletJava Code for a Bubble SortInvariantsEfficiency of the Bubble SortSelection SortSelection Sort on the Baseball PlayersThe SelectSort Workshop AppletJava Code for Selection SortInvariantEfficiency of the Selection SortInsertion SortInsertion Sort on the Baseball PlayersThe InsertSort Workshop AppletJava Code for Insertion SortInvariants in the Insertion SortEfficiency of the Insertion SortSorting ObjectsJava Code for Sorting ObjectsLexicographical ComparisonsStabilityComparing the Simple SortsSummaryQuestionsExperimentsProgramming Projects
4 Stacks and Queues
A Different Kind of StructureProgrammer’s ToolsRestricted AccessMore AbstractStacksThe Postal AnalogyThe Stack Workshop AppletJava Code for a StackStack Example 1: Reversing a WordStack Example 2: Delimiter MatchingEfficiency of StacksQueuesThe Queue Workshop AppletA Circular QueueJava Code for a QueueEfficiency of QueuesDequesPriority QueuesThe PriorityQ Workshop AppletJava Code for a Priority QueueEfficiency of Priority QueuesParsing Arithmetic ExpressionsPostfix NotationTranslating Infix to PostfixEvaluating Postfix ExpressionsSummaryQuestionsExperimentsProgramming Projects
5 Linked Lists
LinksReferences and Basic TypesRelationship, Not PositionThe LinkList Workshop AppletThe Insert ButtonThe Find ButtonThe Delete ButtonA Simple Linked ListThe Link ClassThe LinkList ClassThe insertFirst() MethodThe deleteFirst() MethodThe displayList() MethodThe linkList.java ProgramFinding and Deleting Specified LinksThe find() MethodThe delete() MethodOther MethodsDouble-Ended ListsLinked-List EfficiencyAbstract Data TypesA Stack Implemented by a Linked ListA Queue Implemented by a Linked ListData Types and AbstractionADT ListsADTs as a Design ToolSorted ListsJava Code to Insert an Item in a Sorted ListThe sortedList.java ProgramEfficiency of Sorted Linked ListsList Insertion SortDoubly Linked ListsTraversalInsertionDeletionThe doublyLinked.java ProgramDoubly Linked List as Basis for DequesIteratorsA Reference in the List Itself?An Iterator ClassAdditional Iterator FeaturesIterator MethodsThe interIterator.java ProgramWhere Does the Iterator Point?The atEnd() MethodIterative OperationsOther MethodsSummaryQuestionsExperimentsProgramming Projects
6 Recursion
Triangular NumbersFinding the nth Term Using a LoopFinding the nth Term Using RecursionThe triangle.java ProgramWhat’s Really Happening?Characteristics of Recursive MethodsIs Recursion Efficient?Mathematical InductionFactorialsAnagramsA Recursive Binary SearchRecursion Replaces the LoopDivide-and-Conquer AlgorithmsThe Towers of HanoiThe Towers Workshop AppletMoving SubtreesThe Recursive AlgorithmThe towers.java ProgrammergesortMerging Two Sorted ArraysSorting by MergingThe MergeSort Workshop AppletThe mergeSort.java ProgramEfficiency of the mergesortEliminating RecursionRecursion and StacksSimulating a Recursive MethodWhat Does This Prove?Some Interesting Recursive ApplicationsRaising a Number to a PowerThe Knapsack ProblemCombinations: Picking a TeamSummaryQuestionsExperimentsProgramming Projects
7 Advanced Sorting
ShellsortInsertion Sort: Too Many CopiesN-SortingDiminishing GapsThe Shellsort Workshop AppletJava Code for the ShellsortOther Interval SequencesEfficiency of the ShellsortPartitioningThe Partition Workshop AppletThe partition.java ProgramThe Partition AlgorithmEfficiency of the Partition AlgorithmQuicksortThe Quicksort AlgorithmChoosing a Pivot ValueThe QuickSort1 Workshop AppletDegenerates to O(N2) PerformanceMedian-of-Three PartitioningHandling Small PartitionsRemoving RecursionEfficiency of QuicksortRadix SortAlgorithm for the Radix SortDesigning a ProgramEfficiency of the Radix SortSummaryQuestionsExperimentsProgramming Projects
8 Binary Trees
Why Use Binary Trees?Slow Insertion in an Ordered ArraySlow Searching in a Linked ListTrees to the RescueWhat Is a Tree?Tree TerminologyPathRootParentChildLeafSubtreeVisitingTraversingLevelsKeysBinary TreesAn AnalogyHow Do Binary Search Trees Work?The Binary Tree Workshop AppletRepresenting the Tree in Java CodeFinding a NodeUsing the Workshop Applet to Find a NodeJava Code for Finding a NodeTree EfficiencyInserting a NodeUsing the Workshop Applet to Insert a NodeJava Code for Inserting a NodeTraversing the TreeInorder TraversalJava Code for TraversingTraversing a Three-Node TreeTraversing with the Workshop AppletPreorder and Postorder TraversalsFinding Maximum and Minimum ValuesDeleting a NodeCase 1: The Node to Be Deleted Has No ChildrenCase 2: The Node to Be Deleted Has One ChildCase 3: The Node to Be Deleted Has Two ChildrenThe Efficiency of Binary TreesTrees Represented as ArraysDuplicate KeysThe Complete tree.java ProgramThe Huffman CodeCharacter CodesDecoding with the Huffman TreeCreating the Huffman TreeCoding the MessageCreating the Huffman CodeSummaryQuestionsExperimentsProgramming Projects
9 Red-Black Trees
Our Approach to the DiscussionConceptualTop-Down InsertionBalanced and Unbalanced TreesDegenerates to O(N)Balance to the RescueRed-Black Tree CharacteristicsFixing Rule ViolationsUsing the RBTree Workshop AppletClicking on a NodeThe Start ButtonThe Ins ButtonThe Del ButtonThe Flip ButtonThe RoL ButtonThe RoR ButtonThe R/B ButtonText MessagesWhere’s the Find Button?Experimenting with the Workshop AppletExperiment 1: Inserting Two Red NodesExperiment 2: RotationsExperiment 3: Color FlipsExperiment 4: An Unbalanced TreeMore ExperimentsThe Red-Black Rules and Balanced TreesNull ChildrenRotationsSimple RotationsThe Weird Crossover NodeSubtrees on the MoveHuman Beings Versus ComputersInserting a New NodePreview of the Insertion ProcessColor Flips on the Way DownRotations After the Node Is InsertedRotations on the Way DownDeletionThe Efficiency of Red-Black TreesRed-Black Tree ImplementationOther Balanced TreesSummaryQuestionsExperiments
10 2-3-4 Trees and External Storage
Introduction to 2-3-4 TreesWhat’s in a Name?2-3-4 Tree OrganizationSearching a 2-3-4 TreeInsertionNode SplitsSplitting the RootSplitting on the Way DownThe Tree234 Workshop AppletThe Fill ButtonThe Find ButtonThe Ins ButtonThe Zoom ButtonViewing Different NodesExperimentsJava Code for a 2-3-4 TreeThe DataItem ClassThe Node ClassThe Tree234 ClassThe Tree234App ClassThe Complete tree234.java Program2-3-4 Trees and Red-Black TreesTransformation from 2-3-4 to Red-BlackOperational EquivalenceEfficiency of 2-3-4 TreesSpeedStorage Requirements2-3 TreesNode SplitsImplementationExternal StorageAccessing External DataSequential OrderingB-TreesIndexingComplex Search CriteriaSorting External FilesSummaryQuestionsExperimentsProgramming Projects
11 Hash Tables
Introduction to HashingEmployee Numbers as KeysA DictionaryHashingCollisionsOpen AddressingLinear ProbingJava Code for a Linear Probe Hash TableQuadratic ProbingDouble HashingSeparate ChainingThe HashChain Workshop AppletJava Code for Separate ChainingHash FunctionsQuick ComputationRandom KeysNon-Random KeysHashing StringsFoldingHashing EfficiencyOpen AddressingSeparate ChainingOpen Addressing Versus Separate ChainingHashing and External StorageTable of File PointersNon-Full BlocksFull BlocksSummaryQuestionsExperimentsProgramming Projects
12 Heaps
Introduction to HeapsPriority Queues, Heaps, and ADTsWeakly OrderedRemovalInsertionNot Really SwappedThe Heap Workshop AppletThe Fill ButtonThe Change ButtonThe Remove ButtonThe Insert ButtonJava Code for HeapsInsertionRemovalKey ChangeThe Array SizeThe heap.java ProgramExpanding the Heap ArrayEfficiency of Heap OperationsA Tree-based HeapHeapsortTrickling Down in PlaceUsing the Same ArrayThe heapSort.java ProgramThe Efficiency of HeapsortSummaryQuestionsExperimentsProgramming Projects
13 Graphs
Introduction to GraphsDefinitionsHistorical NoteRepresenting a Graph in a ProgramAdding Vertices and Edges to a GraphThe Graph ClassSearchesDepth-First SearchBreadth-First SearchMinimum Spanning TreesGraphN Workshop AppletJava Code for the Minimum Spanning TreeThe mst.java ProgramTopological Sorting with Directed GraphsAn Example: Course PrerequisitesDirected GraphsTopological SortingThe GraphD Workshop AppletCycles and TreesJava CodeConnectivity in Directed GraphsThe Connectivity TableWarshall’s AlgorithmImplementation of Warshall’s AlgorithmSummaryQuestionsExperimentsProgramming Projects
14 Weighted Graphs
Minimum Spanning Tree with Weighted GraphsAn Example: Cable TV in the JungleThe GraphW Workshop AppletSend Out the SurveyorsCreating the AlgorithmJava CodeThe mstw.java ProgramThe Shortest-Path ProblemThe Railroad LineDijkstra’s AlgorithmAgents and Train RidesUsing the GraphDW Workshop AppletJava CodeThe path.java ProgramThe All-Pairs Shortest-Path ProblemEfficiencyIntractable ProblemsThe Knight’s TourThe Traveling Salesman ProblemHamiltonian CyclesSummaryQuestionsExperimentsProgramming Projects
15 When to Use What
General-Purpose Data StructuresSpeed and AlgorithmsLibrariesArraysLinked ListsBinary Search TreesBalanced TreesHash TablesComparing the General-Purpose Storage StructuresSpecial-Purpose Data StructuresStackQueuePriority QueueComparison of Special-Purpose StructuresSortingGraphsExternal StorageSequential StorageIndexed FilesB-treesHashingVirtual MemoryOnward
A Running the Workshop Applets and Example Programs
The Workshop AppletsThe Example ProgramsThe Sun Microsystem’s Software Development KitCommand-line ProgramsSetting the PathViewing the Workshop AppletsOperating the Workshop AppletsRunning the Example ProgramsCompiling the Example ProgramsEditing the Source CodeTerminating the Example ProgramsMultiple Class FilesOther Development Systems
B Further Reading
Data Structures and AlgorithmsObject-Oriented Programming LanguagesObject-Oriented Design (OOD) and Software Engineering
C Answers to Questions
Chapter 1, OverviewAnswers to QuestionsChapter 2, ArraysAnswers to QuestionsChapter 3, Simple SortingAnswers to QuestionsChapter 4, Stacks and QueuesAnswers to QuestionsChapter 5, Linked ListsAnswers to QuestionsChapter 6, RecursionAnswers to QuestionsChapter 7, Advanced SortingAnswers to QuestionsChapter 8, Binary TreesAnswers to QuestionsChapter 9, Red-Black TreesAnswers to QuestionsChapter 10, 2-3-4 Trees and External StorageAnswers to QuestionsChapter 11, Hash TablesAnswers to QuestionsChapter 12, HeapsAnswers to QuestionsChapter 13, GraphsAnswers to QuestionsChapter 14, Weighted GraphsAnswers to Questions
Index

Content preview from Data Structures and Algorithms in Java, 2nd Edition

12. Heaps

In This Chapter

• Introduction to Heaps

• Java Code for Heaps

• A Tree-based Heap

• Heapsort

We saw in Chapter 4, “Stacks and Queues,” that a priority queue is a data structure that offers convenient access to the data item with the smallest (or largest) key.

Priority queues may be used for task scheduling in computers, where some programs and activities should be executed sooner than others and are therefore given a higher priority.

Another example is in weapons systems, say in a navy cruiser. Numerous threats—airplanes, missiles, submarines, and so on—are detected and must be prioritized. For example, a missile that’s a short distance from the cruiser is assigned a higher priority than an aircraft a long distance away so that countermeasures ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Data Structures and Algorithms in Java, 6th Edition

Publisher Resources

ISBN: 9780134849775

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Data Structures and Algorithms in Java, 2nd Edition

by Robert Lafore

12. Heaps

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.