Java 14 Features (with Examples)
[Series: The most important new Java features from Java 10 to 17]
All new features of Java 14: Switch Expressions, Helpful NullPointerExceptions, Previews: Records + Pattern matching for instanceof + more...
Java 13 Features (with Examples)
[Series: The most important new Java features from Java 10 to 17]
All new features of Java 13 with examples: Switch Expressions (2nd Preview), Text Blocks (Preview), Dynamic CDS Archives + More
Java 12 Features (with Examples)
[Series: The most important new Java features from Java 10 to 17]
All new features of Java 12: new String and Files methods, Teeing Colletor, Default CDS Archives, G1 optimizations + more.
Java 11 Features (with Examples)
[Series: The most important new Java features from Java 10 to 17].
All the new features of Java 11: "var" in Lambdas, HttpClient, new String and Files methods, Epsilon GC, Flight Recorder and more.
Java 10 Features (with Examples)
[New series: The most important new Java features from Java 10 to 17]
All the new features of Java 10: "var", Immutable Collections, Optional.orElseThrow(), Application Class-Data Sharing and more.
The Best History Books (Updated 2022)
Do you need a change from technical books? Something you can read before going to bed without your head spinning all night?
Then this is the right place for you!
Red-Black Tree (Fully Explained, with Java Code)
What is a red-black tree? How do you insert, search and delete nodes? By which rules is the tree balanced? How to implement a red-black tree in Java? And how do you determine its time complexity?
How to Change Java Versions in Windows (Updated for Java 17)
In this article, I'll show you how to install several Java versions simultaneously in Windows and how to switch between them on the command line with short commands.
AVL Tree (with Java Code)
What is an AVL tree? How do you calculate a node's balance factor? How does rotation work and how is an AVL tree balanced? How to implement an AVL tree in Java?
Binary Search Tree (with Java Code)
What is a binary search tree (BST)? How do you insert new elements, how do you search for them, and how do you delete them? How do you implement a BST in Java? And how does it differ from similar data structures?
