Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Java 9 High Performance

You're reading from   Java 9 High Performance Practical techniques and best practices for optimizing Java applications through concurrency, reactive programming, and more

Arrow left icon
Product type Paperback
Published in Nov 2017
Publisher Packt
ISBN-13 9781787120785
Length 398 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (2):
Arrow left icon
Nick Samoylov Nick Samoylov
Author Profile Icon Nick Samoylov
Nick Samoylov
Mayur Ramgir Mayur Ramgir
Author Profile Icon Mayur Ramgir
Mayur Ramgir
Arrow right icon
View More author details
Toc

Table of Contents (11) Chapters Close

1. Learning Java 9 Underlying Performance Improvements FREE CHAPTER 2. Identifying Performance Bottlenecks 3. Learning How to Troubleshoot Code 4. Learning How to Use Profiling Tools 5. Understanding Garbage Collection and Making Use of It 6. Optimizing Code with Microbenchmarking 7. Speeding Up JSON Generation 8. Tools for Higher Productivity and Faster Application 9. Multithreading and Reactive Programming 10. Microservices 11. Making Use of New APIs to Improve Your Code

Understanding value trees

Understanding the value trees requires the understanding of how a tree structure is set up in Java. It is best described as a structure that does not use a linear representation of the data objects. The objects follow a hierarchical system where they are connected to each other in both a parallel and perpendicular manner.

The data present in a tree, such as the one created with a JSON structure, does not have the linear organization found in a simple array. The data elements that are present in a tree structure are usually saved in the form of nodes. There is a node at the tip of the structure, which is termed as the root node of the tree.

This tree structure is perfect when a linear presentation is simply not possible. This happens when there is a need to create a family of specific data elements. Java is able to deal with these trees since there are...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image