Introduction of Binary Tree - The Coding Shala
In this post, we will learn the basic Introduction of Binary Tree Data Structure.
A tree is an important data structure to simulate a hierarchical tree structure. In every tree, there will be a root node and a list of references to other nodes which are called child nodes. If a tree has N nodes then there are N-1 edges connecting them.
A binary tree is one of the typical tree structure. In a Binary tree, each node has at most two children which are referred to as the left and the right child.
How to Traverse a Binary Tree
We can traverse a binary tree using BFS and DFS.
- level order traverse
- Pre Order Traversal
- In Order Traversal
- Post-Order Traversal
Level Order Traversal
- Introduction to Graph Data Structure
- Introduction to Array
- Introduction to String
- Queue Data Structure
- Stack Data Structure