All Problems

10 problems total

Array (1905)Sorting (440)Depth First Search (316)Database (301)Breadth First Search (241)Tree (240)Stack (172)Graph Theory (169)Linked List (81)Monotonic Stack (67)Queue (50)Recursion (48)Shortest Path (33)
All Topics(4301)Algorithms(3944)Database(305)Networking(0)Object Oriented Design(31)Programming Languages(5)System Design(0)

Filter by Difficulty:

EasyMediumHard

Tag:

Company:

Active filters:Tag: traversal/preorder×
TitleDifficultyVideosCompanies
Given preorder traversal of a BST, check if each non-leaf node has only one childmedium-
Locking and unlocking resources represented as binary tree nodesmedium-
google
Number of elements smaller than root in preorder traversal of a BSTmedium-
Maximum Depth of Binary Treeeasy
adobeamazonapple
Construct Binary Tree from Inorder and Preorder Traversalmedium
adobeamazonapple
Convert Sorted Array to height-balanced Binary Search Treeeasy
airbnbamazonapple
Flatten binary tree to linked list in order of preorder traversalmedium-
adobeamazonapple
Verify Preorder Serialization of a Binary Treemedium-
google
Sum of Distances in Treehard-
google
Leaf-Similar Treeseasy-
amazonatlassianfacebook