In this article, we will learn about the level order binary tree traversal. First We will look at the underlying concepts behind level order traversal and then we will implement level order traversal for binary trees in python. What is Level Order Traversal? Level order traversal is a breadth-first binary tree traversal technique. We first […]

In this article, we will study the concept and algorithm for postorder tree traversal. Then we will implement the algorithm for postorder traversal in python and run it on a binary tree. What is Postorder Tree Traversal? Postorder traversal is a depth-first tree traversal algorithm. In depth-first traversal, we start at the root node and […]

In this article, we will study the concept and algorithm for inorder tree traversal. Then we will implement the algorithm for inorder traversal in python and run it on a binary search tree. What is Inorder Tree Traversal? Inorder Traversal is a depth first tree traversal algorithm. In depth first traversal, we start at the […]

In this article, we will study the concept and algorithm for preorder tree traversal. Then we will implement the algorithm for preorder traversal in Python and run it on a binary tree. What is Preorder Tree Traversal? Preorder traversal is a depth-first tree traversal algorithm. In depth-first traversal, we start at the root node and […]

In this article, we will learn about binary search trees. We will study the underlying concepts behind binary search trees and then implement the code. You should be familiar with the concepts of binary trees to read this article. What is a binary search tree? A binary search tree is a binary tree data structure […]

In this article, we will study balanced binary trees and we will try to implement a program in Python to determine if a binary tree is balanced or not. To read this article, you should be familiar with the concept of binary trees. What is a Balanced Binary Tree? A balanced binary tree is defined […]