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 construct an Expression tree for an Infix Expression. A binary expression tree is a specific application of a binary tree to evaluate certain expressions. Two common types of expressions that a binary expression tree can represent are algebraic[1] and boolean. These trees can represent expressions that contain both unary … Read more
This is a C++ Program to create an expression tree and print the various traversals using postfix expression. 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 on a Linux system. The program output is also shown below. #include … Read more
This is a C++ Program for counting number of nodes present in a tree using recursion. Problem Description Here in this problem we will be finding the total number of nodes present in a given tree using C++ Language. Expected Input and Output Case 1. Balanced Tree:When the weight is equal on both the sides … Read more
This is a C++ Program for counting the total number of leaf nodes present in a given Binary Search Tree. Problem Description We will be given a Binary Search Tree and we have to create a C++ program which counts the total number of leaf nodes present in it using recursion. A leaf node is … Read more
This is a C++ Program for counting the total number of internal nodes present in a given Binary Search Tree. Problem Description We will be given a Binary Search Tree and we have to create a C++ program which counts the total number of non-leaf nodes i.e. Internal Nodes present in it using recursion. An … Read more
This is a C++ Program to perform Left Rotation in Binary Search Trees. In discrete mathematics, tree rotation is an operation on a binary tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. It is used to … Read more
This is a C++ Program to check if BST is AVL. An AVL tree is a self-balancing binary search tree. It was the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ … Read more
This C++ Program demonstrates the Removal of All the nodes which don’t lie in any Path with Sum greater than or equal to K. Here is source code of the C++ Program to Remove All the nodes which don’t lie in any Path with Sum >= K. The C++ program is successfully compiled and run … Read more
This is a C++ Program to check whether tree is subtree of another tree. Given two binary trees, check if the first tree is subtree of the second one. A subtree of a tree T is a tree S consisting of a node in T and all of its descendants in T. The subtree corresponding … Read more
