DSA for Frontend bank

Trees & BST

DSA for Frontend / 142 questions

Your progress 0 / 142 done

Saved in this browser.

001 Longest Substring Without Repeating Characters Medium
002 Minimum Window Substring Hard
003 Longest Palindromic Substring Medium
004 Palindromic Substrings Medium
005 Maximum Depth of Binary Tree Easy
006 Same Tree Easy
007 Invert/Flip Binary Tree Easy
008 Binary Tree Maximum Path Sum Hard
009 Binary Tree Level Order Traversal Medium
010 Serialize and Deserialize Binary Tree Hard
011 Subtree of Another Tree Easy
012 Construct Binary Tree from Preorder and Inorder Traversal Medium
013 Validate Binary Search Tree Medium
014 Kth Smallest Element in a BST Medium
015 Lowest Common Ancestor of a Binary Search Tree Medium
016 Palindromic Substrings (DP variant) Medium
017 Diameter of Binary Tree Easy
018 Symmetric Tree Easy
019 Binary Tree Right Side View Medium
020 Flatten Binary Tree to Linked List Medium
021 Count Complete Tree Nodes Medium
022 Delete Node in a BST Medium
023 Binary Tree Zigzag Level Order Traversal Medium
024 Invert Binary Tree Easy
025 Balanced Binary Tree Easy
026 Count Good Nodes in Binary Tree Medium
027 Lowest Common Ancestor of a Binary Tree Medium
028 Minimum Height Trees Medium
029 Convert Sorted Array to Binary Search Tree Easy
030 Substring with Concatenation of All Words Hard
031 Sum Root to Leaf Numbers Medium
032 Binary Search Tree Iterator Medium
033 Average of Levels in Binary Tree Medium
034 Minimum Absolute Difference in BST Easy
035 Construct Quad Tree Medium
036 Fruits into Basket (Longest Substring with 2 Distinct) Medium
037 Level Order Traversal of Binary Tree Medium
038 Preorder, Inorder, Postorder Traversal (Iterative) Medium
039 Height of a Binary Tree Easy
040 Check if Binary Tree is Balanced Medium
041 Maximum Path Sum in Binary Tree Hard
042 Zig-Zag Traversal of Binary Tree Medium
043 Boundary Traversal of Binary Tree Medium
044 Vertical Order Traversal of Binary Tree Medium
045 Top View of Binary Tree Medium
046 Bottom View of Binary Tree Medium
047 Symmetric Binary Tree Easy
048 Root to Node Path in Binary Tree Medium
049 Lowest Common Ancestor in Binary Tree Medium
050 Maximum Width of Binary Tree Medium
051 Construct Binary Tree from Inorder and Preorder Hard
052 Morris Inorder Traversal Medium
053 Count Nodes in a Complete Binary Tree Medium
054 Search in a Binary Search Tree Easy
055 Ceil and Floor in a BST Easy
056 Insert a Given Node in BST Medium
057 Delete a Node in BST Medium
058 Kth Smallest/Largest Element in BST Medium
059 Validate a BST Medium
060 LCA in a Binary Search Tree Easy
061 Construct a BST from a Preorder Traversal Medium
062 Two Sum in BST Easy
063 Recover BST Hard
064 Largest BST in Binary Tree Hard
065 Level Order Traversal Medium
066 Diameter of a Binary Tree Easy
067 Mirror of a Binary Tree Easy
068 Left View and Right View of a Tree Medium
069 Top View and Bottom View of a Tree Medium
070 Zig-Zag Traversal of a Binary Tree Medium
071 Check if a Tree is Balanced Medium
072 Boundary Traversal of a Binary Tree Medium
073 Construct Tree from Inorder and Preorder Hard
074 Find LCA in a Binary Tree Medium
075 Find a Value in a BST Easy
076 Delete a Node in a BST Medium
077 Find Min and Max Value in a BST Easy
078 Check if a Tree is a BST Medium
079 Find LCA of Two Nodes in a BST Easy
080 Merge Two BSTs Hard
081 Find Kth Largest/Smallest Element in a BST Medium
082 Largest BST in a Binary Tree Hard
083 Longest Palindromic Substring (DP) Medium
084 Palindromic Substrings (DP) Medium
085 Find the longest palindrome in a string (Longest Palindromic Substring) Medium
086 Split a binary string into two substrings with equal 0s and 1s Medium
087 Reverse level order traversal Medium
088 Height of a tree Easy
089 Diameter of a tree Easy
090 Mirror of a tree Easy
091 Inorder traversal (recursive and iterative) Easy
092 Preorder traversal (recursive and iterative) Easy
093 Postorder traversal (recursive and iterative) Easy
094 Left view of a tree Medium
095 Right view of a tree Medium
096 Top view of a tree Medium
097 Bottom view of a tree Medium
098 Check if a tree is balanced or not Medium
099 Diagonal traversal of a binary tree Medium
100 Construct a binary tree from a string with bracket representation Medium
101 Convert a binary tree into a doubly linked list Hard
102 Convert a binary tree into a sum tree Medium
103 Construct a binary tree from inorder and preorder traversal Hard
104 Find minimum swaps required to convert a binary tree into a BST Hard
105 Check if a binary tree is a sum tree or not Medium
106 Check if all leaf nodes are at the same level Easy
107 Check if a binary tree contains duplicate subtrees of size 2 or more Hard
108 Check if two trees are mirrors of each other Easy
109 Sum of nodes on the longest path from root to leaf node Medium
110 Find the largest subtree sum in a tree Medium
111 Maximum sum of nodes in a binary tree such that no two are adjacent Hard
112 Print all K sum paths in a binary tree Hard
113 Find the distance between two nodes in a binary tree Medium
114 Find the Kth ancestor of a node in a binary tree Medium
115 Find all duplicate subtrees in a binary tree Hard
116 Tree isomorphism problem Medium
117 Deletion of a node in a BST Medium
118 Find inorder successor and inorder predecessor in a BST Medium
119 Check if a tree is a BST or not Medium
120 Populate inorder successor of all nodes Medium
121 Convert a binary tree into a BST Medium
122 Convert a normal BST into a balanced BST Medium
123 Find the Kth largest element in a BST Medium
124 Find the Kth smallest element in a BST Medium
125 Count pairs from two BSTs whose sum equals a given value X Hard
126 Find the median of a BST in O(n) time and O(1) space Hard
127 Count BST nodes that lie in a given range Medium
128 Check if a given preorder traversal is a valid BST Medium
129 Check whether a BST contains a dead end Medium
130 Find the largest BST in a binary tree Hard
131 Flatten a BST to a sorted list Medium
132 Length of the longest valid substring Hard
133 Check if all levels of two trees are anagrams of each other Medium
134 Check if a binary tree is a heap Medium
135 Convert a BST into a min heap Medium
136 Longest Common Substring Medium
137 Count balanced binary trees of height h Hard
138 Optimal Binary Search Tree Hard
139 Longest Substring Without Repeating Medium
140 Lowest Common Ancestor of BST Medium
141 Kth Smallest Element in BST Medium
142 Construct Binary Tree from Preorder Medium