Tag: Binary Tree

Binary Search Tree Implementation

binary-search-tree-python-implementation

Binary Search Trees are an effective solution to store data in a computer program and perform a binary search. The benefits of using a BST (Binary Search Tree) data structure is that data can be added to the tree as

Lossless Compression: Huffman Coding Algorithm

huffman-coding-path

The Huffman Coding algorithm is used to implement lossless compression. For the purpose of this blog post, we will investigate how this algorithm can be implemented to encode/compress textual information. The principle of this algorithm is to replace each character

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