Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Try it on GfG Practice Postorder traversal is a depth-first tree traversal method where each node is processed after its left and right children. While recursive postorder traversal is common, an iterative approach using a single stack offers a more efficient alternative. This article explains how…

Menu Back to Explore Page

Try it on GfG Practice Given a binary tree, write an iterative function to print the Preorder traversal of the tree. The Preorder traversal follows the order: Root → Left → Right. Examples: Input: 1 / \ 2 3 / \ 4 5 Output: 1 2 4 5 3 Explanation: Preorder traversal (Root->Left->Right) of the tree is…

Menu Back to Explore Page

Try it on GfG Practice Given a binary tree, write a program to count the number of Single Valued Subtrees. A Single Valued Subtree is one in which all the nodes have same value. Expected time complexity is O(n). Example: Input: root of below tree 5 / \ 1 5 / \ \ 5 5 5 Output: 4 There are 4 subtrees…

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Given a binary tree, the task is to find the zigzag level order traversal of the tree. In zig zag traversal starting from the first level go from left to right for odd-numbered levels and right to left for even-numbered levels. Table of Content Using Recursion - O(n) Time and O(n) Space The idea is…

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Menu Back to Explore Page

Given a binary tree, the task is to determine the diameter of the tree. The diameter/width of a tree is defined as the number of edges on the longest path between any two nodes. Examples: Input: Output: 2 Explanation: The longest path has 2 edges (node 2 -> node 1 -> node 3). Input: Output: 4…

Menu Back to Explore Page

Try it on GfG Practice Given a binary tree, the task is to find the maximum depth of the tree. The maximum depth or height of the tree is the number of edges in the tree from the root to the deepest node. Examples: Input: Output: 2 Explanation: The longest path from the root (node 12) goes through…

Menu Back to Explore Page

Try it on GfG Practice Given a binary tree, the task is to convert the binary tree to its Mirror tree. Mirror of a Binary Tree T is another Binary Tree M(T) with left and right children of all non-leaf nodes interchanged. Example 1: Explanation: In the inverted tree, every non-leaf node has its left…

Menu Back to Explore Page

Menu Back to Explore Page

In this post, we will compare Red-Black Tree and AVL Tree. Red Black Tree: Properties: Self-Balancing is provided by painting each node with two colors(Red or Black).When the Tree is modified, a new tree is subsequently rearranged and repainted.It requires 1 bit of color information for each node in…

A binary Search Tree is a node-based binary tree data structure that has the following properties: The left subtree of a node contains only nodes with keys lesser than the node’s key.The right subtree of a node contains only nodes with keys greater than the node’s key.The left and right subtree each…

A binary tree is a type of data structure where each node can only have two offspring at most named as “left” and “right” child. A Binary Tree There are different types of binary tree but here we are going to discuss about the difference of Complete binary tree and Full binary tree. Full Binary…

B-Tree: B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. In B-tree, a node can have more than two children. B-tree has a height of logM N (Where ‘M’ is the order of tree and N is the number of nodes). And the height is adjusted automatically at each update.…

B-Tree : B-Tree is known as a self-balancing tree as its nodes are sorted in the inorder traversal. Unlike the binary trees, in B-tree, a node can have more than two children. B-tree has a height of logM N (Where ‘M’ is the order of tree and N is the number of nodes). And the height adjusts…

A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right children. Binary Tree Data Structure A binary search tree is a hierarchical data structure where each node has at most two…

Difference between General tree and Binary tree Last Updated : 19 Feb, 2020 Improve Suggest changes Like Article Like Report In the data structure, General tree is a tree in which each node can have either zero or many child nodes. It can not be empty. In general tree, there is no limitation on the…

An array is a collection of homogeneous(same type) data items stored in contiguous memory locations. For example, if an array is of type “int”, it can only store integer elements and cannot allow the elements of other types such as double, float, char, etc. The array is a linear data structure in…

Stack: A Stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the top. Insertion is called push operation and deletion is called pop operation in case of the stack. The order of insertion and deletion may be LIFO(Last In First Out)…

1. Binary Search Tree : An acyclic graph is commonly used to illustrate a Binary Search Tree. The tree is made up of nodes. Each node in a binary tree has no more than two children. Every node's value is strictly higher than the value of its left child and strictly lower than the value of its right…

What is Heap? A Heap is a special Tree-based data structure in which the tree is a complete binary tree. There are two types of heap - Min heap and Max heap. To learn more about heap, go through the following article: Introduction to Heap What is a Red-Black Tree? The red-Black tree is a…