About Me & MyBlog
Software Engineer | Polyglot Programmer | Gym Lover | Cyclist | Algorithm Addict | Programming and Research enthusiast | Life Long Passionate Learner | Love CSE, Backend and DataHi, thanks for your interest on my blog 🙂 I am Syed Ahmed Zaki, Founder of CodeLiftio! This is my blog “Zakilive.Com” for sharing my knowledge and passion with you all.
I was born in a beautiful country of south asia named Bangladesh. I am a Computer Science and Engineering graduate from Daffodil International University. I am passionate, dedicated, hardworking about my tasks and fond of Algorithms, Competitive Programming, Mathematics, Research in data science(Machine Learning, AI, NLP, Deep Learning), bioinformatics and IoT. I also love software engineering. In software development field I prefer Web Application Engineering.
In my Daffodil life I tried to participate in several programming contests(online, onsite, intra etc.) and passed some time in ACM training class for sharpening my logical skills. As an ordinary people it was little bit tough for me alongside with academic pressure, thesis and research paper writing but I love challenges so I always tried to push my limits though still I need to improve a lot in everything but I always trust in this quote “Hard work beats talent”. That quote I have learned from my life through bodybuilding of 6 years since 2012 and after losing 33 KG fat in 4 months from 101 KG I developed my fit physique, so I respectfully believe in this sentence and relate this with CSE field. I also love to learn from my failures. I hate excuses while working professionally and I love trying to finish my work with perfection till the last moment before deadline.
I also love to explore and play with new technologies and try to implement it with innovative ideas. In my university life, I always tried to learn from the basics of CS. So, I have tried to gather Networking to Database Knowledge, OS fundamentals to OOP etc. all fundamental core basics in my skillset in a practical approach.
Alongside with developing some web applications in core php and laravel framework I have also tried to build games with unity3d game engine, built 2 android apps, experimented machine learning with python, data mining with WEKA, AI chatbot, IoT based weather station and some more project works for my undergraduate courses. As I am language and platform agnostic, I enjoyed and learned a lot from all of these works. I also love teamwork. Alongside software engineering and different extra curricular activities I also love teaching. I am also proficient at working with linux and windows based OSes and I feel so lucky if I get chance to contribute in opensource projects. In my linkedin profile you will find more details about me.
However, I am actually a knowledge seeker and life long passionate learner who tries to make his weakness as strength, I was a serious student of all the courses in CS academia that can solve real life problems as I love to explore knowledge in a crafted manner. I love to study books, blogs or whatever philosophically solve my curiosity. For that, I maintain a good collection of various technological, scientific and philosophical books in my small library. Knowledge sharing, analytical thinking, practice and passing the passion of mine with you is one of my motivations for running this blog. I practice to hone my skills with trying to improve my programming and developing skillset day by day and what I learn, I never forget to share here for you.
In my free time I love to do cycling or gym or play racing games in my android phone or watch animated movies and also love to promote positive, fit and healthy lifestyle among people.
Connect with me:
Currently I am working with .NET technologies. If you have any opportunity/business to work with me or any other query kindly say just hi to me at my mail:
[email protected]
Category Archives: Tree
Binary Search Tree: Successor in Inorder Traversal
code:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 |
/* C++ program to find Inorder successor in a BST */ #include<bits/stdc++.h> using namespace std; struct Node { int data; struct Node *left; struct Node *right; }; //Function to find some data in the tree Node* Find(Node*root, int data) { if(root == NULL) return NULL; else if(root->data == data) return root; else if(root->data < data) return Find(root->right,data); else return Find(root->left,data); } //Function to find Node with minimum value in a BST struct Node* FindMin(struct Node* root) { if(root == NULL) return NULL; while(root->left != NULL) root = root->left; return root; } //Function to find Inorder Successor in a BST struct Node* Getsuccessor(struct Node* root,int data) { // Search the Node - O(h) struct Node* current = Find(root,data); if(current == NULL) return NULL; if(current->right != NULL) { //Case 1: Node has right subtree return FindMin(current->right); // O(h) } else { //Case 2: No right subtree - O(h) struct Node* successor = NULL; struct Node* ancestor = root; while(ancestor != current) { if(current->data < ancestor->data) { successor = ancestor; // so far this is the deepest node for which current node is in left ancestor = ancestor->left; } else ancestor = ancestor->right; } return successor; } } //Function to visit nodes in Inorder void Inorder(Node *root) { if(root == NULL) return; Inorder(root->left); //Visit left subtree printf("%d ",root->data); //Print data Inorder(root->right); // Visit right subtree } // Function to Insert Node in a Binary Search Tree Node* Insert(Node *root,char data) { if(root == NULL) { root = new Node(); root->data = data; root->left = root->right = NULL; } else if(data <= root->data) root->left = Insert(root->left,data); else root->right = Insert(root->right,data); return root; } int main() { /*Code To Test the logic Creating an example tree 5 / \ 3 10 / \ \ 1 4 11 */ Node* root = NULL; root = Insert(root,5); root = Insert(root,10); root = Insert(root,3); root = Insert(root,4); root = Insert(root,1); root = Insert(root,11); //Print Nodes in Inorder cout<<"Inorder Traversal: "; Inorder(root); cout<<"\n"; // Find Inorder successor of some node. struct Node* successor = Getsuccessor(root,1); if(successor == NULL) cout<<"No successor Found\n"; else cout<<"Successor is "<<successor->data<<"\n"; } |
https://www.youtube.com/watch?v=5cPbNCrdotA
Posted in Binary Search Tree, Tree
Delete a node in Binary Search Tree
https://www.youtube.com/watch?v=gcULXE7ViZw
code:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 |
#include<bits/stdc++.h> using namespace std; struct Node{ int data; struct Node* left; struct Node* right; }; Node* FindMin(Node* root) { while(root->left!=NULL) root=root->left; return root; } //Function to search a delete value from tree struct Node* Delete(struct Node *root, int data) { if(root==NULL) return root; else if(data<root->data) root->left=Delete(root->left,data); else if(data>root->data) root->right=Delete(root->right,data); else{ //case 1: No child if(root->left==NULL && root->right==NULL) { delete root; root=NULL; } //case 2: one child else if(root->left==NULL) { struct Node* temp=root; root=root->right; delete temp; } else if(root->right==NULL) { struct Node* temp=root; root=root->left; delete temp; } //case 3: 2 children else{ struct Node * temp=FindMin(root->right); root->data=temp->data; root->right=Delete(root->right, temp->data); } } return root; } //function to visit nodes in inorder void Inorder(Node* root) { if(root==NULL) return; Inorder(root->left); //visit left subtree printf("%d ",root->data); //print data Inorder(root->right); //visit right subtree } Node* Insert(Node *root, char data) { if(root==NULL) { root=new Node(); root->data=data; root->left=root->right=NULL; } else if(data<=root->data) root->left=Insert(root->left,data); else root->right=Insert(root->right,data); return root; } int main() { Node *root=NULL; root=Insert(root,5); root=Insert(root,10); root=Insert(root,3); root=Insert(root,4); root=Insert(root,1); root=Insert(root,11); root=Delete(root,5); //Print Nodes in Inorder cout<<"Inorder: "; Inorder(root); cout<<"\n"; } |
Posted in Binary Search Tree, Tree
Traversal in Binary Search Tree
Height of a binary tree:
https://www.youtube.com/watch?v=_pnqMz5nrRs
Level Order BFS in Binary Search Tree:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 |
#include<bits/stdc++.h> #include<queue> using namespace std; struct Node { char data; Node *left; Node *right; }; //Function to print nodes in a binary tree in level order void LevelOrder(Node *root) { if(root==NULL) return; queue<Node*> Q; Q.push(root); //while there is at least one discovered node while(!Q.empty()) { Node* current=Q.front(); Q.pop(); cout<<current->data<<" "; if(current->left!=NULL) Q.push(current->left); if(current->right!=NULL) Q.push(current->right); } } //Function to insert node in a binary search tree Node* Insert(Node *root, char data) { if(root==NULL) { root=new Node(); root->data=data; root->left=root->right=NULL; } else if(data<=root->data) root->left=Insert(root->left,data); else root->right=Insert(root->right,data); return root; } int main() { //creating an example tree Node *root=NULL; root=Insert(root,'M'); root=Insert(root,'B'); root=Insert(root,'Q'); root=Insert(root,'Z'); root=Insert(root,'A'); root=Insert(root,'C'); LevelOrder(root); } |
output:
|
1 |
M B Q A C Z |
https://www.youtube.com/watch?v=gm8DUJJhmY4&index=34&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
DFS in Preorder, Inorder, Postorder:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 |
#include<bits/stdc++.h> #include<queue> using namespace std; struct Node { char data; Node *left; Node *right; }; //Function to print nodes in a binary tree in level order void Preorder(struct Node* root){ if(root==NULL) return; printf("%c ",root->data);//print data Preorder(root->left); //visit left subtree Preorder(root->right); //Visit right subtree } //function to visit nodes in Inorder void Inorder(Node* root) { if(root==NULL) return; Inorder(root->left); //Visit left subtree printf("%c ",root->data); //Print data Inorder(root->right); //Visit right subtree } void Postorder(Node* root) { if(root==NULL) return; Postorder(root->left); //visit left subtree Postorder(root->right); //visit right subtree printf("%c ",root->data); //print data } //Function to insert node in a binary search tree Node* Insert(Node *root, char data) { if(root==NULL) { root=new Node(); root->data=data; root->left=root->right=NULL; } else if(data<=root->data) root->left=Insert(root->left,data); else root->right=Insert(root->right,data); return root; } int main() { //creating an example tree Node *root=NULL; root=Insert(root,'M'); root=Insert(root,'B'); root=Insert(root,'Q'); root=Insert(root,'Z'); root=Insert(root,'A'); root=Insert(root,'C'); //Print nodes in preorder cout<<"Preorder: "; Preorder(root); cout<<endl; //Print nodes in in inorder cout<<"Inorder: "; Inorder(root); cout<<endl; //Print Nodes in postorder cout<<"Postorder: "; Postorder(root); cout<<endl; return 0; } |
output:
|
1 2 3 |
Preorder: M B A C Q Z Inorder: A B C M Q Z Postorder: A C B Z Q M |
Posted in Binary Search Tree, Tree
Binary Search Tree
youtube :
https://www.youtube.com/watch?v=COZK7NATh4k
code:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 |
#include<iostream> using namespace std; //Definition of Node for Binary search tree struct BstNode { int data; BstNode* left; BstNode* right; }; //Function to create new Node in heap BstNode* GetNewNode(int data) { BstNode* newNode=new BstNode(); newNode->data=data; newNode->left=newNode->right=NULL; return newNode; } //To search an element in BST return true if element is found bool Search(BstNode* root, int data) { if(root==NULL) return false; else if(root->data==data) return true; else if(data<=root->data) return Search(root->left,data); else return Search(root->right,data); } //TO insert data in BST, return address of root node BstNode* Insert(BstNode* root, int data) { if(root==NULL) //empty tree { root=GetNewNode(data); } //if data to be inserted is lesser, insert it in left subtree else if(data<=root->data) { root->left=Insert(root->left,data); } //else, insert in right subtree else { root->right=Insert(root->right,data); } return root; } int main() { BstNode* root=NULL;//creating an empty tree /* Code to test the logic */ root=Insert(root,15); root=Insert(root,10); root=Insert(root,20); root=Insert(root,25); root=Insert(root,8); root=Insert(root,12); //asking user to enter a number int number; cout<<"Enter number to be searched:\n"; cin>>number; //If number is found, print "FOUND" if(Search(root,number)==true) cout<<"Found\n"; else cout<<"Not Found\n"; return 0; } |
Posted in Binary Search Tree, Tree
