Blog Archives

Binary Trees – Linked Lists

binary-search-tree-02

Binary trees are useful data structures used to solve specific computational problems. They provide a visual representation of how data can be stored and linked. Computers use linked lists to store the information of binary trees. This blog post will

Binary Expression Trees

Boolean-expression-tree-1

A binary expression tree is a specific kind of a binary tree used to represent expressions. Two common types of expressions that a binary expression tree can represent are algebraic expressions and boolean expressions. These trees can represent expressions that

Traversal of a Binary-Tree

breadth-first-traversal

In this blog post we will investigate four key algorithms used to read through the content of a binary tree: Breadth-First Traversal Algorithm Depth-First Algorithms: Pre-Order Traversal In-Order Traversal Post-Order Traversal Binary Tree? A Binary Tree is a data structure

Our Latest Book