Practice

Coding Problems

150 problemsPage 5 of 7

Easy
Preorder Traversal
Binary TreeJavaPythonCC++JavaScript
Easy
Postorder Traversal
Binary TreeJavaPythonCC++JavaScript
Easy
Level Order Traversal
Binary TreeJavaPythonCC++JavaScript
Easy
Height of Binary Tree
Binary TreeJavaPythonCC++JavaScript
Easy
Count Leaf Nodes
Binary TreeJavaPythonCC++JavaScript
Easy
Check Identical Trees
Binary TreeJavaPythonCC++JavaScript
Medium
Check Balanced Binary Tree
Binary TreeJavaPythonCC++JavaScript
Medium
Diameter of Binary Tree
Binary TreeJavaPythonCC++JavaScript
Medium
Lowest Common Ancestor
Binary TreeJavaPythonCC++JavaScript
Medium
Zigzag Level Order Traversal
Binary TreeJavaPythonCC++JavaScript
Hard
Serialize and Deserialize Binary Tree
Binary TreeJavaPythonCC++JavaScript
Hard
Maximum Path Sum in Binary Tree
Binary TreeJavaPythonCC++JavaScript
Hard
Boundary Traversal
Binary TreeJavaPythonCC++JavaScript
Hard
Vertical Order Traversal
Binary TreeJavaPythonCC++JavaScript
Easy
Search in BST
Binary Search TreeJavaPythonCC++JavaScript
Medium
Insert into BST
Binary Search TreeJavaPythonCC++JavaScript
Medium
Delete from BST
Binary Search TreeJavaPythonCC++JavaScript
Easy
Minimum and Maximum in BST
Binary Search TreeJavaPythonCC++JavaScript
Medium
Kth Smallest Element in BST
Binary Search TreeJavaPythonCC++JavaScript
Medium
Implement Min Heap
Heap & Priority QueueJavaPythonCC++JavaScript
Medium
Implement Max Heap
Heap & Priority QueueJavaPythonCC++JavaScript
Easy
K Largest Elements
Heap & Priority QueueJavaPythonCC++JavaScript
Easy
K Smallest Elements
Heap & Priority QueueJavaPythonCC++JavaScript
Medium
Merge K Sorted Arrays
Heap & Priority QueueJavaPythonCC++JavaScript

Coding Problems

Problems

Preorder Traversal

Postorder Traversal

Level Order Traversal

Height of Binary Tree

Count Leaf Nodes

Check Identical Trees

Check Balanced Binary Tree

Diameter of Binary Tree

Lowest Common Ancestor

Zigzag Level Order Traversal

Serialize and Deserialize Binary Tree

Maximum Path Sum in Binary Tree

Boundary Traversal

Vertical Order Traversal

Search in BST

Insert into BST

Delete from BST

Minimum and Maximum in BST

Kth Smallest Element in BST

Implement Min Heap

Implement Max Heap

K Largest Elements

K Smallest Elements

Merge K Sorted Arrays