# Tag Archives: morris-traversal

Perform Postorder Tree traversal using Morris Traversal. Examples: Input:         1             /          \ ā¦ Read More
Given a Binary Tree and an integer K, the task is to delete nodes from the given Tree such that the sum of all nodesā¦ Read More
Prerequisites:- Morris Inorder Traversal, Tree Traversals (Inorder, Preorder and Postorder)Given a Binary Tree, the task is to print the elements in post order using O(N)ā¦ Read More
Given a binary tree, the task is to traverse the Binary Tree in level order fashion.Examples:   Input: 1 / \ 2 3 Output: 1 2ā¦ Read More
Given a Binary Tree and two numbers P and K, the task is to print the K Inorder Successor of the given number P fromā¦ Read More
Given a Binary Search Tree and a number N, the task is to find the smallest number in the binary search tree that is greaterā¦ Read More
Given a BST, the task is to find the sum of all elements greater than or equal to K-th largest element in O(1) space.Examples:  Inputā¦ Read More
Given a binary search tree and a target node K. The task is to find the node with the minimum absolute difference with given targetā¦ Read More
Given two values n1 and n2 (where n1 < n2) and a root pointer to a Binary Search Tree. Print all the keys of treeā¦ Read More