This is a C Program to implement range tree. range Tree: The idea is to augment a self-balancing Binary Search Tree (BST) like Red Black Tree, AVL Tree, etc to maintain set of ranges so that all operations can be done in order log n time. Here is source code of the C Program to … Read more
This is a C Program to construxt and solve expression tree for postfix expression. A binary expression tree is a specific application of a binary tree to evaluate certain expressions. Here is source code of the C Program to Construct an Expression Tree for a Postfix Expression. The C program is successfully compiled and run … Read more
This is a C Program to implement interval tree. Consider a situation where we have a set of intervals and we need following operations to be implemented efficiently. 1) Add an interval 2) Remove an interval 3) Given an interval x, find if x overlaps with any of the existing intervals. Interval Tree: The idea … Read more
This is a C Program to print odd levels of the tree. There are basically two functions in this method. One is to print all nodes at a given level (printGivenLevel), and other is to print level order traversal of the tree (printLevelorder). printLevelorder makes use of printGivenLevel to print nodes at all levels one … Read more
This is a C Program to perform insertion opertion in binary search tree. A new key is always inserted at leaf. We start searching a key from root till we hit a leaf node. Once a leaf node is found, the new node is added as a child of the leaf node. Here is source … Read more
This is a C Program to print the double order traversal of the given tree. Recurse through: 1. Visit root of (sub)tree. 2. Visit left sub-tree. 3. Revisit root of (sub)tree. 4. Visit right sub-tree. Here is source code of the C Program to Implement Double Order Traversal of a Binary Tree. The C program … Read more
This is a C Program to perform deletion in binary search tree. The important thing to note is, inorder successor is needed only when right child is not empty. In this particular case, inorder successor can be obtained by finding the minimum value in right child of the node. Here is source code of the … Read more
This is a C Program to check whether the given tree is AVL or not. A tree where no leaf is much farther away from the root than any other leaf. Different balancing schemes allow different definitions of “much farther” and different amounts of work to keep them balanced. Consider a height-balancing scheme where following … Read more
This is a C Program to implement segment tree. We have an array arr[0 . . . n-1]. We should be able to 1. Find the sum of elements from index l to r where 0
This is a C Program to perform searching an element in BST. To search a given key in Bianry Search Tree, we first compare it with root, if the key is present at root, we return root. If key is greater than root’s key, we recur for right subtree of root node. Otherwise we recur … Read more
