#Day_92 of #gfg160 Challenge by
@geeksforgeeks
Today's problem: Given the root of a Binary search tree(BST), where exactly two nodes were swapped by mistake. Your task is to fix (or correct) the BST by swapping them back. Do not change the structure of the tree. #geekstreak2024
#Day_91 of #gfg160 Challenge by
@geeksforgeeks Today's problem: Given a Binary Search Tree(BST) and a target. Check whether there's a pair of Nodes in the BST with value summing up to the target. #geekstreak2024
#Day_90 of #gfg160 Challenge by
@geeksforgeeks Today's problem: Given a BST and an integer k, the task is to find the kth smallest element in the BST. If there is no kth smallest element present then return -1. #geekstreak2024
#Day_89 of #gfg160 Challenge by
@geeksforgeeks Today's problem: Given the root of a binary tree. Check whether it is a BST or not.
Note: We are considering that BSTs can not contain duplicate Nodes. #geekstreak2024
#Day_88 of #gfg160 Challenge by @geeksforgeeks Today's problem: a binary tree and an integer k, determine number of downward-only paths where sum of the node values in path equals k. A path can start and end at any node within the tree but must always move down #geekstreak2024
#Day_87 of #gfg160 Challenge by
@geeksforgeeks Today's problem: Given a binary tree, the task is to find the maximum path sum. The path may start and end at any node in the tree. #geekstreak2024
#Day_85 of #gfg160 Challenge by
@geeksforgeeks
Today's problem: Given a Binary Tree, your task is to return its In-Order Traversal. An inorder traversal first visits the left child, then visits the node, and finally visits the right child. #geekstreak2024
#Day_84 of #gfg160 Challenge by
@geeksforgeeks Today's problem: Given two arrays representing the inorder and preorder traversals of a binary tree, construct the tree and return the root node of the constructed tree. #geekstreak2024
#Day_83 of #gfg160 Challenge by
@geeksforgeeks Today's problem: Given a binary tree, 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. #geekstreak2024
#Day_82 of #gfg160 Challenge by
@geeksforgeeks Today's problem: a binary tree, the diameter is defined as the number of edges on the longest path between two leaf nodes in the tree. This path may or may not pass through the root. find the diameter of the tree. #geekstreak2024
#Day_81 of #gfg160 Challenge by
@geeksforgeeks Today's problem: Given a binary tree, find its height.
The height of a tree is defined as the number of edges on the longest path from the root to a leaf node. A leaf node is a node that does not have any children. #geekstreak2024
#Day_80 of #gfg160 Challenge by
@geeksforgeeks Today's problem: Given a root of a binary tree with n nodes, the task is to find its level order traversal. Level order traversal of a tree is breadth-first traversal for the tree.#geekstreak2024
#Day_79 of #gfg160 Challenge by
@geeksforgeeks Today's problem: You are given a two-dimensional mat of size n*m containing English alphabets and a string word. Check if the word exists on the mat. The word can be constructed by using letters from adjacent cells, #geekstreak2024
#Day_75 of #gfg160 Challenge by
@geeksforgeeks Today's problem: Given a string s, which may contain duplicate characters, your task is to generate and return an array of all unique permutations of the string. You can return your answer in any order.
#geekstreak2024