Search for a command to run...
Clearing pre order, in order and post order traversal confusion under 2 minutes
I go by theroyakash on the internet. I am a computer scientist, with research in high performance algorithms, data structures, distributed systems, and beyond. See my work searching google for theroyakash.
No comments yet. Be the first to comment.
This is a data structure series where I introduce you to popular data structures and their implementations using python and my python based data structure and algorithms library AKDSFramework.
Graph implementation and usage in C++
Graph implementation and usage in C++
Setup audio version of your articles for free.
![Set-up an audio version of your blog articles [Works Automatically]](/_next/image?url=https%3A%2F%2Fcdn.hashnode.com%2Fres%2Fhashnode%2Fimage%2Fupload%2Fv1612940767582%2F0abS3UT_8.png&w=3840&q=75)
Build and run algorithms on Priority Queues (as binary heaps) with just a few lines of code with AKDSFramework.
Introducing an efficient Big O analyzer, a premium state-of-the-art AKDSFramework feature to analyze Big O for any function without any human intervention. As you already know calculating big O is a big part of what we do to approximate the running t...
Let's don't waste time and finish the "confusing" topic of pre order, post order and in order traversal on binary trees. Most of my friends tell me that they often forget how each traversal works and ask me how to remember them. Well, here you go
When running through a tree (binary or binary search tree) we start from the root. Two things to do
Now arrange the queue of nodes like this if we visit
And now you have 3 queues each with pre-in-post order traversal path.
Also make a note that if the binary tree is a binary search tree, then the in-order traversal will give a sorted array. We can use this property to check if the binary tree is a binary search tree or not.
Let's see some C code for this traversal algorithm
Tree Structure
struct TreeNode {
char data;
struct TreeNode *left, *right;
};
typedef struct TreeNode TreeNode;
Traversal Algorithms
void inOrderTraversal(TreeNode *nodePointer){
if (nodePointer != NULL) {
inOrderTraversal(nodePointer->left);
printf("%c", nodePointer->data);
inOrderTraversal(nodePointer->right);
}
}
void preOrderTraversal(TreeNode *nodePointer){
if (nodePointer != NULL) {
printf("%c", nodePointer->data);
preOrderTraversal(nodePointer->left);
preOrderTraversal(nodePointer->right);
}
}
void postOrderTraversal(TreeNode *nodePointer){
if (nodePointer != NULL) {
postOrderTraversal(nodePointer->left);
postOrderTraversal(nodePointer->right);
printf("%c", nodePointer->data);
}
}
To see the proper algorithm on this visit here
Get all the updates directly into your inbox by subscribing to the blog.