Search an element in a binary tree. Simple Java example.

How to search an element in a binary tree in Java? This problem is one of the fundamental issues in any technical interview. Here, the basic logic is almost the same as inserting the element in the binary tree. To find an element that value less than the root value, we are going on the […]

How to insert an element in a binary tree in Java? That is one of the common questions in any technical interview. The basic logic here is to put elements that value less than the root on the binary tree’s left side. And put the elements that value more than the root element on the […]

The most simplistic approach to implement post-order traversal. The design of traversing a binary tree in an in-order way. There are three kinds of binary tree traversal: post-order, in-order, pre-order. It is a typical task in any professional interview. Therefore you should learn all variations and details. The initial and primary fact is that you […]

The simplest way to implement pre-order traversal. The pattern of traversing a binary tree in an in-order way. There are three varieties of binary tree traversal: in-order, pre-order, post-order. It is a common task in any technical interview. Thus you should understand all variations and details. The primary and central fact is that you need […]

How to implement pre-order traversal? Example of traversing a binary tree in a pre-order way. There are three types of binary tree traversal: pre-order, in-order, post-order. It is a widespread question on any technical interview. So you should know all differences and details. The first and main point is that you need to keep in […]

How to implement a binary tree in Java? That question is one of the most popular in any technical interview. A binary tree is one of the fundamental data structures. That’s why you should learn how to create it. In this lesson, I will show the most straightforward way of implementation. Example of the binary […]