Problems on Binary Tree Operations in Threaded Binary Tree There are three main operations which can be done on a threaded binary tree Insert, Search and Delete operation which we have explained in depth.
Problems on Binary Tree Threaded Binary Tree Threaded binary tree is a simple binary tree but they have a speciality that null pointers of leaf node of the binary tree is set to inorder predecessor or inorder successor.
Software Engineering C++ Likely and Unlikely attributes C++ likely and unlikely attributes came into existence with the release of C++ 20. In our C++ code if we know which lines of code would most probably be executed during our code execution then we can use likely and unlikely attributes.
Software Engineering Immediate Functions in C++ Immediate functions or the functions which have consteval keyword before their return type has been introduced with the release of C++ 20 , consteval functions are the functions that must be evaluated at compile time to produce a constant.
Software Engineering Explicit in C++ Explicit is a keyword in C++ which was introduced with C++ 11 this is used to cast a data type and also to change the by default implicit conversion in C++.
Problems on Binary Tree Convert Binary Tree to Threaded Binary Tree We will focus on different approaches on how to convert a normal binary tree into a threaded binary tree. We will convert our binary tree to single threaded binary tree with right pointers pointing to inorder successor (if it exists).
Data Structures Augmented Data Structures Augmenting a data structure (or Augmented Data Structure) means using a existing data structure and making some changes in that data structure to fit our needs. We have explained the idea of augmented data structure with examples.
Algorithms Finding Diameter of Tree using Height of each Node We have explored the algorithm on how to find the diameter of the tree using height of each node. This will take linear time O(V+E) time complexity.
Problems on Binary Tree Finding Diameter of a Tree using DFS In this article, we will be discussing how to find the diameter of a tree or graph using Depth First Search (DFS).
Problems on Binary Tree Algorithm to find Level of each node from root node In this article we will be discussing on how to find the level of each node in a graph, the algorithm that we will be using to find the level of each node is breadth first search.
Software Engineering priority_queue::push() in C++ Push function in priority queue is used to to insert a element in the queue, the element is inserted in the priority queue based on it's value which defines it's priority in the queue.
Software Engineering Different Ways to Initialize Priority queue in C++ We have demonstrated different Ways to Initialize Priority queue in C++ such as using Max Heap, Min Heap and with vector and array.
