Binary Tree - 101 Computing

Morse Code using a Binary Tree

Administrator — Tue, 30 Nov 2021 23:08:45 +0000

The Morse Code was designed to quickly transfer messages using a series of “dots (.)” and “dashes (-)”. Morse code was named after Samuel Morse, one of the inventors of the telegraph. The International Morse Code includes the 26 letters…

The post Morse Code using a Binary Tree first appeared on 101 Computing.

Prime Factor Tree Algorithm

Administrator — Tue, 09 Nov 2021 22:37:40 +0000

The Prime Factor Tree is a visual technique used in Maths to workout all the prime factors of a large number. With this approach, all the leaf nodes (nodes without sub-branches) are the prime factors of the root node. For…

The post Prime Factor Tree Algorithm first appeared on 101 Computing.

Binary Search Tree Implementation

Administrator — Thu, 04 Mar 2021 20:35:59 +0000

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…

The post Binary Search Tree Implementation first appeared on 101 Computing.

Lossless Compression: Huffman Coding Algorithm

Administrator — Thu, 04 Mar 2021 12:27:16 +0000

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…

The post Lossless Compression: Huffman Coding Algorithm first appeared on 101 Computing.

Binary Trees – Linked Lists

Administrator — Thu, 27 Apr 2017 10:45:05 +0000

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…

The post Binary Trees – Linked Lists first appeared on 101 Computing.

Binary Expression Trees

Administrator — Tue, 25 Apr 2017 16:59:27 +0000

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…

The post Binary Expression Trees first appeared on 101 Computing.

Traversal of a Binary-Tree

Administrator — Mon, 24 Apr 2017 21:26:35 +0000

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…

The post Traversal of a Binary-Tree first appeared on 101 Computing.