Weak AVL trees, also known as rank-balanced trees, are a type of self-balancing binary search tree that aims to balance the tree while minimizing the number of rotations needed to maintain balance. These trees are similar to AVL trees in that they both use rotations to maintain balance, but they…

Try it on GfG Practice We have discussed Insertion of AVL Tree. In this post, we will follow a similar approach for deletion. Steps to follow for deletion. To make sure that the given tree remains AVL after every deletion, we must augment the standard BST delete operation to perform some…

An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one. Balance Factor = left subtree height - right subtree height For a Balanced Tree(for every node): -1 ≤ Balance Factor ≤ 1 Example of…

A Binary Search Tree (BST) is a type of binary tree data structure in which each node contains a unique key and satisfies a specific ordering property: All nodes in the left subtree of a node contain values strictly less than the node’s value. All nodes in the right subtree of a node contain values…

Given a Binary Search Tree, The task is to print the elements in inorder, preorder, and postorder traversal of the Binary Search Tree. Input: A Binary Search Tree Output: Inorder Traversal: 10 20 30 100 150 200 300 Preorder Traversal: 100 20 10 30 200 150 300 Postorder Traversal: 10 30 20 150 300…

Given a BST, the task is to insert a new node in this BST. Example: How to Insert a value in a Binary Search Tree: A new key is always inserted at the leaf by maintaining the property of the binary search tree. We start searching for a key from the root until we hit a leaf node. Once a leaf node is…

Binary Search Tree (BST) is a data structure that is commonly used to implement efficient searching, insertion, and deletion operations along with maintaining sorted sequence of data. Please remember the following properties of BSTs before moving forward. The left subtree of a node contains only…

Given an array that represents a tree in such a way that array indexes are values in tree nodes and array values give the parent node of that particular index (or node). The value of the root node index would always be -1 as there is no parent for root. Construct the standard linked representation…

Given a binary tree, we need to print all leaf nodes of the given binary tree from left to right. That is, the nodes should be printed in the order they appear from left to right in the given tree. For Example, Input : Root of the below tree Output : 4 6 7 9 10 Corner Cases : For a tree with single…

A Binary Tree is labeled if every node is assigned a label and a Binary Tree is unlabelled if nodes are not assigned any label. Below two are considered same unlabelled trees o o / \ / \ o o o o Below two are considered different labelled trees A C / \ / \ B C A B How many different Unlabelled…

Try it on GfG Practice Given a binary tree, the task is to delete a given node from it by making sure that the tree shrinks from the bottom (i.e. the deleted node is replaced by the bottom-most and rightmost node). This is different from BST deletion. Here we do not have any order among elements, so…

Given a binary tree and a key, the task is to insert the key into the binary tree at the first position available in level order manner. Examples: Input: key = 12 Output: Explanation: Node with value 12 is inserted into the binary tree at the first position available in level order manner. Approach:…

Given a Binary Tree and a node, the task is to find the parent of the given node in the tree. Return -1 if the given node is the root node. Note: In a binary tree, a parent node of a given node is the node that is directly connected above the given node. Examples: Input: target = 3 Output: 1…

Given a Binary tree and a key. The task is to search and check if the given key exists in the binary tree or not. Examples: Input: Output: True Input: Output: False Approach: The idea is to use any of the tree traversals to traverse the tree and while traversing check if the current node matches…

Try it on GfG Practice Given a Binary Tree and a key, the task is to find the level of key in the Binary Tree. Examples: Input : key = 4 Output: 3 Explanation: The level of the key in above binary tree is 3. Input : key = 10 Output: -1 Explanation: Key is not present in the above Binary tree. Table…

Given a Binary Tree consisting of n nodes and a integer k, the task is to find the depth and height of the node with value k in the Binary Tree. Note: The depth of a node is the number of edges present in path from the root node of a tree to that node. The height of a node is the maximum number of…

Try it on GfG Practice Given a Binary Tree, the task is to find its Level Order Traversal. Level Order Traversal technique is a method to traverse a Tree such that all nodes present in the same level are traversed completely before traversing the next level. Example: Input: Output: [[5], [12, 13],…

Try it on GfG Practice Postorder traversal is a tree traversal method that follows the Left-Right-Root order: The left subtree is visited first.The right subtree is visited next.The root node is processed last. How does Postorder Traversal work? Key Properties: It is used for tree deletion because…

Try it on GfG Practice Preorder traversal is a tree traversal method that follows the Root-Left-Right order: The root node of the subtree is visited first.Next, the left subtree is recursively traversed.Finally, the right subtree is recursively traversed. How does Preorder Traversal work? Key…

Try it on GfG Practice Inorder traversal is a depth-first traversal method that follows this sequence: Left subtree is visited first.Root node is processed next.Right subtree is visited last. How does Inorder Traversal work? Key Properties: If applied to a Binary Search Tree (BST), it returns…

We have discussed Introduction to Binary Tree in set 1 and the Properties of Binary Tree in Set 2. In this post, common types of Binary Trees are discussed. Types of Binary Tree based on the number of children: Following are the types of Binary Tree based on the number of children: Full Binary…

Given a binary tree and target node. By giving the fire to the target node and fire starts to spread in a complete tree. The task is to print the sequence of the burning nodes of a binary tree. Rules for burning the nodes : Fire will spread constantly to the connected nodes only.Every node takes the…

Menu Back to Explore Page

Given a binary tree, the task is to connect the nodes that are at the same level. Given an addition nextRight pointer for the same.Initially, all the next right pointers point to garbage values, set these pointers to the point next right for each node. Examples: Input: Output: Explanation: The above…

Try it on GfG Practice Given a binary tree in which each node element contains a number. Find the maximum possible sum from one leaf node to another. Examples: Input: Output: 27 Explanation: The maximum sum path may or may not go through the root. For example, in the following binary tree, the…

Try it on GfG Practice Given a binary tree, a target node in the binary tree, and an integer value k, the task is to find all the nodes at a distance k from the given target node. No parent pointers are available. Note: You have to return the list in sorted order.The tree will not contain duplicate…

Try it on GfG Practice Given a binary tree, print nodes of extreme corners of each level but in alternate order.Example: For above tree, the output can be 1 2 7 8 31 - print rightmost node of 1st level - print leftmost node of 2nd level - print rightmost node of 3rd level - print leftmost node of…

Menu Back to Explore Page

Try it on GfG Practice Given a Binary Tree and a key, write a function that prints all the ancestors of the key in the given binary tree. For example, if the given tree is following Binary Tree and the key is 7, then your function should print 4, 2, and 1. 1 / \ 2 3 / \ 4 5 / 7 Recommended Practice…

Try it on GfG Practice Given the root of a Binary Tree with all unique values and two node values n1 and n2, the task is to find the lowest common ancestor of the given two nodes. The Lowest Common Ancestor (or LCA) is the lowest node in the tree that has both n1 and n2 as descendants. In other…

Try it on GfG Practice Given a binary tree, the task is to perform in-order traversal of the tree without using recursion. Example: Input: Output: 4 2 5 1 3 Explanation: Inorder traversal (Left->Root->Right) of the tree is 4 2 5 1 3 Input: Output: 1 7 10 8 6 10 5 6 Explanation: Inorder traversal…

Menu Back to Explore Page

Given a Binary Search Tree (BST) and a positive integer k, the task is to find the kth largest element in the Binary Search Tree. Example: Input: k = 3 Output: 14 Explanation: If we sort the BST in decreasing order, then it will become 22, 20, 14, 12, 10, 8, 4. 14 is the 3rd largest element.…

Menu Back to Explore Page

Try it on GfG Practice Given a 2d-array arr[][] which represents the nodes of a Binary tree, the task is to find the maximum GCD of the siblings of this tree without actually constructing it. Example: Input: arr[][] = {{4, 5}, {4, 2}, {2, 3}, {2, 1}, {3, 6}, {3, 12}} Output: 6 Explanation: For the…

Given a binary tree, find the largest value in each level. Examples : Input : 1 / \ 2 3 Output : 1 3 Input : 4 / \ 9 2 / \ \ 3 5 7 Output : 4 9 7 Recommended Problem Maximum Value Solve Problem Approach: The idea is to recursively traverse tree in a pre-order fashion. Root is considered to be at…

Try it on GfG Practice Given a binary tree, the task is to check for every node, its value is equal to the sum of values of its immediate left and right child. For NULL values, consider the value to be 0. Also, leaves are considered to follow the property. Example: Input: Output: 1 Explanation: The…

Try it on GfG Practice Given a binary tree, determine if it is height-balanced. A binary tree is considered height-balanced if the absolute difference in heights of the left and right subtrees is at most 1 for every node in the tree. Examples: Input: Output: True Explanation: The height difference…

Try it on GfG Practice Given a binary tree, the task is to check whether it is a mirror of itself. Example: Input: root[] = [1, 2, 2, 3, 4, 4, 3] Output: True Explanation: Tree is mirror image of itself i.e. tree is symmetric. Input: root[] = [1, 2, 2, N, 3, N, 3] Output: False Explanation: Tree is…

Try it on GfG Practice Given two binary trees, the task is to find if both of them are identical or not. Two trees are identical when they have the same data and the arrangement of data is also the same. Examples: Input: Output: Yes Explanation: Trees are identical. Input: Output: No Explanation:…