more and more
Depth First Search in Java 1. Overview In this tutorial, we’ll explore the Depth-first search in Java. Depth-first search (DFS) is a traversal algorithm used for both Tree and Graph data structures. The depth-first search goes deep in each branch before moving to explore another branch. In the next sections, we’ll… Continue Reading java-depth-first-search
getdocs
Thread Safe LIFO Data Structure Implementations 1. Introduction In this tutorial, we’ll discuss various options for Thread-safe LIFO Data structure implementations. In the LIFO data structure, elements are inserted and retrieved according to the Last-In-First-Out principle. This means the last inserted element is retrieved first. In computer science, stack is… Continue Reading java-lifo-thread-safe
getdocs
Monte Carlo Tree Search for Tic-Tac-Toe Game 1. Overview In this article, we’re going to explore the Monte Carlo Tree Search (MCTS) algorithm and its applications. We’ll look at its phases in detail by implementing the game of Tic-Tac-Toe in Java. We’ll design a general solution which could be used… Continue Reading java-monte-carlo-tree-search
getdocs
Quick Guide to Java Stack 1. Overview In this article, we’ll introduce the java.util.Stack class and start looking at how we can make use of it. The Stack is a generic data structure which represents a LIFO (last in, first out) collection of objects allowing for pushing/popping elements in constant… Continue Reading java-stack
getdocs
Implementing a Binary Tree in Java 1. Introduction In this article, we’ll cover the implementation of a binary tree in Java. For the sake of this article, we’ll use a sorted binary tree that will contain int values. 2. Binary Tree A binary tree is a recursive data structure where… Continue Reading java-binary-tree
getdocs
Reversing a Binary Tree in Java 1. Overview Reversing a binary tree is one of the problems that we might be asked to solve during a technical interview. In this quick tutorial, we’ll see a couple of different ways of solving this problem. 2. Binary Tree A binary tree is… Continue Reading java-reversing-a-binary-tree
getdocs
Implementing a Binary Tree in Kotlin 1. Overview In this tutorial, we’ll implement the basic operations for a binary tree using the Kotlin programming language. Feel free to check our Java version of this same tutorial. 2. Definition In programming, a binary tree is a tree where every node has no… Continue Reading kotlin-binary-tree
getdocs
Defining a Char Stack in Java 1. Overview In this tutorial, we’ll discuss how to create a char stack in Java. We’ll first see how we can do this by using the Java API, and then we’ll look at some custom implementations. Stack is a data structure that follows the… Continue Reading java-char-stack
getdocs
The Trie Data Structure in Java 1. Overview Data structures represent a crucial asset in computer programming, and knowing when and why to use them is very important. This article is a brief introduction to trie (pronounced “try”) data structure, its implementation and complexity analysis. 2. Trie A trie is… Continue Reading trie-java
getdocs