Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Misc7.7K+ articles

Tree911+ articles

Binary Tree330+ articles

Advanced Data Structure306+ articles

Binary Search Tree166+ articles

tree-traversal88+ articles

BST25+ articles

Binary Search Trees18+ articles

threaded-binary-tree

9 posts

Count the number of Nodes in a Binary Tree in Constant Space

Last Updated: 23 July 2025

Given a binary tree having N nodes, count the number of nodes using constant O(1) space. This can be done by simple traversals like- Preorder, InOrder, PostOrder, and Leve...read more

article_image

Geeks Premier League

threaded-binary-tree

morris-traversal

Geeks Premier League 2023

Double Threaded Binary Search Tree

Last Updated: 02 December 2023

Double Threaded Binary Search Tree: is a binary search tree in which the nodes are not every left NULL pointer points to its inorder predecessor and the right NULL pointer...read more

article_image

Advanced Data Structure

Binary Search Trees

threaded-binary-tree

Threaded Binary Search Tree | Deletion

Last Updated: 23 July 2025

A threaded binary tree node looks like following.C++ struct Node { struct Node *left, *right; int info; // false if left pointer points to predecessor ...read more

article_image

Binary Search Tree

threaded-binary-tree

Threaded Binary Tree | Insertion

Last Updated: 14 September 2023

We have already discuss the Binary Threaded Binary Tree.Insertion in Binary threaded tree is similar to insertion in binary tree but we will have to adjust the threads aft...read more

article_image

Binary Search Tree

threaded-binary-tree

Convert a Binary Tree to Threaded binary tree | Set 2 (Efficient)

Last Updated: 23 July 2025

Idea of Threaded Binary Tree is to make inorder traversal faster and do it without stack and without recursion. In a simple threaded binary tree, the NULL right pointers a...read more

article_image

threaded-binary-tree

Inorder Non-threaded Binary Tree Traversal without Recursion or Stack

Last Updated: 23 July 2025

We have discussed Thread based Morris Traversal. Can we do inorder traversal without threads if we have parent pointers available to us?Input: Root of Below Tree [Every no...read more

threaded-binary-tree

Convert a Binary Tree to Threaded binary tree | Set 1 (Using Queue)

Last Updated: 23 July 2025

We have discussed Threaded Binary Tree. The idea of threaded binary trees is to make inorder traversal faster and do it without stack and without recursion. In a simple th...read more

article_image

threaded-binary-tree

Threaded Binary Tree

Last Updated: 21 August 2025

Inorder traversal of a Binary tree can either be done using recursion or with the use of a auxiliary stack. The idea of threaded binary trees is to make inorder traversal ...read more

article_image

threaded-binary-tree

Morris traversal for Inorder

Last Updated: 08 October 2025

Given the root of a binary tree, Find its inorder traversal using Morris Traversal, i.e., without using recursion or a stack.Examples:Input:Output: [4, 2, 5, 1, 3]Explanat...read more

article_image

threaded-binary-tree