7 Useful Data Structures Every Java Programmer Should Know

The image & subroutine have absolutely nothing to do with the topic but IDE’s on Macbooks just look so cleeean. They’re literally the go-to for CS students now so Imma just roll wit it.

1. LinkedLists

2. HashMaps

  • (String keys & Integer vals) or the same type (String keys & String vals)

3. Multidimensional Arrays

4. Queues

5. Stacks

6. Trees

  • A is a parent of B and C.
  • B is called a child of A.
  • B and C are siblings.
  • E, F, H, I, and J are leaves.

7. Heaps

  • Min-Heap: every single parent node, including the root, is less than or equal to the value of its children nodes. The node with the smallest, or minimum value, will always be the root node.
  • Max-Heap: essentially the opposite of a min-heap; every parent node, including the root, is greater than or equal to the value of its children nodes. The node with the largest, or maximum value will always be at the root node.
That’s not a hug. I’m grabbing the door for you.

--

--

--

CTO @ Nothing

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Understanding Python scopes

May Feature Update: Editable Prices & End-User Data

Deposit and Withdraw VLX

Getting Started with Conducto on Ubuntu

Getting Started with Azure for Free

8 Hands-on Labs for Docker in the Enterprise

Episode 2: “The Holy Grail” — GraalVM (Building “Super Optimum MicroServices Architecture” Series)

Python data types explained

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Devarshi Patel

Devarshi Patel

CTO @ Nothing

More from Medium

How to Debug Spring Boot Application using Intellij

String Manipulation in Python

SAP — Logging onto SAP System

Loops & Comprehension in Python