🌳 The tree data structure

Everyone may remember this classical data structure from his studies or more recently from a job interview 😅

A tree is represented by nodes and each nodes may have 0 or more children nodes. In this article, we will look into the binary tree, a tree where each node may have 0, 1 or 2 children.

Image for post

A binary tree

In term of vocabulary, the blue node is called the root and the yellow nodes without children are called leafs. The two child nodes are called left and right children.

#go #golang #algorithms #concurrency #programming

How to speed up a Tree structure traversal in Go?
1.60 GEEK