Start Learning

Trees

Practice Trees problems for coding interviews.

0/12

completed

Balanced Binary Tree

Easy O(N)

Binary Tree Inorder Traversal

Easy O(N)

Diameter of Binary Tree

Easy O(N)

Invert Binary Tree

Easy O(N)

Maximum Depth of Binary Tree

Easy O(N)

Easy O(N)

Subtree of Another Tree

Easy O(N * M)

Binary Tree Level Order Traversal

Medium O(N)

Count Good Nodes in Binary Tree

Medium O(N)

Kth Smallest Element in a BST

Medium O(H + K)

Lowest Common Ancestor of a BST

Medium O(H)

Validate Binary Search Tree

Medium O(N)