Building the Expression Tree
Let’s Start! The reason why we need the expression tree is that in case of compilers, when languages are translated…
Uses of Binary Tree
Start We know that when user gave input in-order, it resulted in linked list. But searches for linked list become…
Deletion of Node in AVL tree
Let’s Start! We know that insertion in a height-balanced tree requires at most one single rotation or one double rotation….
Cases of Rotation in AVL tree
Let’s Start! As we know that, in Example of Insertion of nodes in AVL tree, the single rotation was not…
Insertion of node in the AVL Tree
Let’s Start! AVL tree, which is already balanced. Before we perform insertion, we need to careful about the balance of…
AVL Tree
What’s AVL Tree AVL tree has been named after two persons Adelson-Velskii and Landis. These two had devised a technique…
The const Keyword
Let’s start! We use const keyword many times. The const keyword is often used in function signatures. The function signature…
Reference Variables
Let’s Start! In this article, we’ll discuss reference variables with help of examples. The symbol &, used for reference variable…
Level order traversal and Deletion of node in BST
Level order Traversal “In level order traversal, we visit the nodes at each level before proceeding to the next level.”…
Recursive and Non-recursive calls in Traversal of Binary Tree
Recursive Calls When a function calls some other function, the parameters and return address of the function is put in…