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?
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?
In this article, I have compiled a list of the best books for programmers.
The books cover programming in general (hard skills and soft skills) and Java programming in particular.
What is a binary tree, and what types exist? How to implement a binary tree in Java? What are its operations? What are pre-order, in-order, post-order, and level-order traversals?
How does binary search work? How to implement binary search in Java? What binary search functions does the JDK provide? How fast is binary search compared to linear search?