Python AVL Tree in Python [using OOP + Inheritance] AVL (Adelson-Velsky and Landis) tree is a self-balancing binary search tree, where the balance factor of each node is the difference between the heights of its left and right subtrees i.e. either -1, 0, or 1.

Problems on Binary Tree BST to greater sum tree In this article, we will be discussing about the problem "BST to greater sum tree" in detail. This involve the concept of inorder traversal.

Problems on Binary Tree Minimum distance between two given nodes of Binary Tree In this article, we will be discussing about the problem "Minimum distance between two given nodes of a Binary Tree" in detail. This involve the concept of lowest common ancestor.

Problems on Binary Tree Connect Nodes at Same Level in Binary Tree In this article, we will be discussing about the problem "Connect Nodes at Same Level in a Binary Tree" in detail. This involve the concept of Breadth First Search (BFS) or Level Order Traversal.

Problems on Binary Tree Extreme nodes in alternate order In this article, we will be discussing about the problem "Extreme nodes in alternate order in a Binary tree" in detail. This involve the concept of Breadth First Search (BFS) and level order traversal.

Problems on Binary Tree Odd even level difference in a binary tree In this article, I will be discussing about the problem "Children sum parent in a Binary Tree" in detail.

Problems on Binary Tree Children sum parent in a Binary Tree In this article, I will be discussing about the problem "Children sum parent in a Binary Tree" in detail.

Algorithms Iterative In-order Traversal In this article, we have explored the concept of Iterative In-order Traversal along with detailed step by step example and complete implementation.

Problems on Binary Tree Degenerate or Pathological Tree Degenerate or Pathological Tree is a variant of Binary Tree which we have explored in depth along with code implementation for Degenerate or Pathological Tree.

Algorithms Iterative post-order traversal In this article, we have explained how to do Iterative post-order traversal of a Binary Tree using 3 different techniques along with complete implementation.

Algorithms Weight Balanced Binary Tree A self-balancing binary search tree is a type of binary tree that automatically adjusts its structure on insertion or deletion in order to maintain balance. Here, we will learn about Weight Balanced Binary Tree, which is a type of self-balancing binary search tree.

Problems on Binary Tree Almost complete binary tree In this article, we have explored the concept of Almost complete binary tree.

Algorithms Strictly Binary Tree A binary tree is a type of the tree data structure in which a parent node has at most two child nodes. Here, we will understand an important type of binary tree called Strictly Binary Tree and see how it differs from other binary tree types.

Problems on Binary Tree Perfect Binary Tree Perfect Binary Tree is one of the types of Binary Tree data structure. In this article, we will learn about the Perfect Binary Tree and its properties. We will also see how it differs from other types of Binary Tree.

Algorithms Complete Binary Tree In this article, we will learn about the what is the tree, Binary tree and complete binary tree also how it differs from a general Binary Tree in terms of different operations.

Algorithms Preorder traversal in Binary Tree [Iterative + Recursive] Preorder traversal is one of the traversal in binary tree in which the root node is visited first then the left subtree and then the right subtree. The order can be written as ROOT LEFT RIGHT.

Problems on Binary Tree Check if binary tree is symmetrical In this article, we will discuss the algorithms to find out whether the given binary tree is symmetrical or non-symmetrical.

Problems on Binary Tree Bottom view of a Binary Tree In this article, we have explained the algorithm to find the Bottom view of a Binary Tree.

Algorithms Max path sum between two nodes in Binary Tree In this article, we have explored algorithms to find the Max path sum between two nodes in Binary Tree along with time and space complexity.

Problems on Binary Tree Boundary Traversal of Binary Tree In this article, we have explored the approach of Boundary Traversal of Binary Tree along with Time and Space Complexity.

Algorithms Morris Inorder Traversal in Binary Tree In this article, you will learn about a method to traverse a tree in O(1) space complexity that is without using recursion or stack. We will use the concept of Single Threaded Binary Tree.

Data Structures Binary Search Tree with Parent Pointer In this article, we have covered Binary Search Tree with Parent Pointer which is a modification of the standard Data Structure, Binary Tree.

Problems on Binary Tree Select Random Node from Binary Tree In this article, we have presented two algorithms to select a random node from Binary Tree while maintaining the uniform randomness.

Algorithms Cayleyâ€™s formula In this article, we have explained the idea of Cayleyâ€™s formula which is used to find the number of trees with N nodes and M connected components. We have presented an implementation to calculate Cayleyâ€™s formula.

Time Complexity Time and Space complexity of Binary Search Tree (BST) In this article, we are going to explore and calculate about the time and space complexity of binary search tree operations.