Loading problems...

All Problems

17 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)Database(305)Networking(0)Object Oriented Design(31)Programming Languages(5)System Design(0)Algorithms(3944)

Filter by Difficulty:

Easy Medium Hard

🎥Has Video

Tag:

Company:

Active filters:Tag: traversal/inorder×

Title	Difficulty	Videos	Companies
Given a binary search tree with 2 nodes swapped find number of pairs not following BST properties	easy	-
Inorder predecessor and successor of a node in binary search tree	medium	-
Inorder Successor in Binary Tree	medium	-
Kth largest element in Binary Search Tree	medium	-
Morris Traversal	hard	-	palantir
Populate next pointer to inorder successor in Binary Tree	medium	-
Validate Binary Search Tree	medium		adobe amazon apple
Recover Binary Search Tree	medium	-	amazon bloomberg facebook
Maximum Depth of Binary Tree	easy		adobe amazon apple
Construct Binary Tree from Inorder and Preorder Traversal	medium		adobe amazon apple
Construct Binary Tree from Inorder and Postorder Traversal	medium	-	amazon bloomberg facebook
Binary Search Tree BST Inorder Iterator	medium	-	alibaba amazon apple
Inorder Successor in Binary Search Tree	medium	-	amazon bloomberg citadel
Delete in a Binary Search Tree	medium	-	amazon apple bloomberg
Inorder Successor in Binary Search Tree Using Parent link	medium	-	bloomberg google microsoft
Convert BST to Greater Sum Tree	medium		amazon apple microsoft
Construct String from Binary Tree	medium	-	amazon