All DSA
Interview Guide

Trees

0%
Coding
Theory
  • Average of Levels in Binary Tree

    Junior
  • Balanced Binary Tree

    Junior
  • Binary Tree Inorder Traversal

    Junior
  • Binary Tree Paths

    Junior
  • Closest Binary Search Tree Value

    Junior
  • Convert Sorted Array to Binary Search Tree

    Junior
  • Cousins in Binary Tree

    Junior
  • Diameter of Binary Tree

    Junior
  • Flatten Binary Tree to Linked List

    Junior
  • Invert Binary Tree

    Junior
  • Maximum Depth of Binary Tree

    Junior
  • Merge Two Binary Trees

    Junior
  • Minimum Absolute Difference in BST

    Junior
  • Path Sum

    Junior
  • Range Sum of BST

    Junior
  • Same Tree

    Junior
  • Search in a Binary Search Tree

    Junior
  • Second Minimum Node In a Binary Tree

    Junior
  • Subtree of Another Tree

    Junior
  • Symmetric Tree

    Junior
  • Two Sum IV - Input is a BST

    Junior
  • Univalued Binary Tree

    Junior
  • All Nodes Distance K in Binary Tree

    Mid
  • Amount of Time for Binary Tree to Be Infected

    Mid
  • Binary Encoding Tree Challenge

    Mid
  • Binary Search Tree Iterator

    Mid
  • Binary Tree Level Order Traversal

    Mid
  • Binary Tree Longest Consecutive Sequence

    Mid
  • Binary Tree Pruning

    Mid
  • Binary Tree Right Side View

    Mid
  • Binary Tree Subsequence Check

    Mid
  • Binary Tree Upside Down

    Mid
  • Binary Tree Views (Top, Bottom, Level Order)

    Mid
  • Binary Tree Zigzag Level Order Traversal

    Mid
  • Bottom View of Binary Tree

    Mid
  • Boundary of Binary Tree

    Mid
  • Closest Leaf in a Binary Tree

    Mid
  • Construct Binary Tree from Inorder and Postorder Traversal

    Mid
  • Construct Binary Tree from Preorder and Inorder Traversal

    Mid
  • Construct Quad Tree

    Mid
  • Convert Binary Search Tree to Sorted Doubly Linked List

    Mid
  • Count Complete Tree Nodes

    Mid
  • Count Univalue Subtrees

    Mid
  • Deepest Leaves Sum

    Mid
  • Delete Leaves With a Given Value

    Mid
  • Diagonal Traversal of Binary Tree

    Mid
  • Distance Between Two Nodes in Binary Tree

    Mid
  • Factory Cost / Bill of Materials

    Mid
  • Flood the Tree

    Mid
  • House Robber III

    Mid
  • Inorder Successor in BST

    Mid
  • Kth Largest Element in BST

    Mid
  • Kth Smallest Element in a BST

    Mid
  • Longest Distinct Path from Root

    Mid
  • Longest Path With Different Adjacent Characters

    Mid
  • Lowest Common Ancestor of a Binary Search Tree

    Mid
  • Maximum Width of Binary Tree

    Mid
  • Nested Comment Threading

    Mid
  • Parent-Child Job Runtime

    Mid
  • Path from Root to Node

    Mid
  • Path Sum II

    Mid
  • Path Sum III

    Mid
  • Print All Leaf Nodes of a Binary Tree

    Mid
  • Print Binary Tree

    Mid
  • Remove Single-Child Nodes

    Mid
  • Root to Node Path in Binary Tree

    Mid
  • Serialize and Deserialize BST

    Mid
  • Split BST

    Mid
  • Sum of Nodes with Even-Valued Grandparent

    Mid
  • Sum Tree Validation

    Mid
  • Time Needed to Inform All Employees

    Mid
  • Top View of Binary Tree

    Mid
  • Tree Parent Search

    Mid
  • Tree Structure Reporting

    Mid
  • Trim a Binary Search Tree

    Mid
  • Valid Binary Tree Root

    Mid
  • Validate Binary Search Tree

    Mid
  • Binary Tree Cameras

    Senior
  • Binary Tree Maximum Path Sum

    Senior
  • Closest Binary Search Tree Value II

    Senior
  • Count Pairs of Connectable Servers in a Weighted Tree Network

    Senior
  • Cut Off Trees for Golf Event

    Senior
  • Find Path in Implicit Fibonacci Tree

    Senior
  • K-th Smallest in Lexicographical Order

    Senior
  • Longest Valid Path in General Tree (Arithmetic Progression)

    Senior
  • Maximum Invitations

    Senior
  • Minimum Iterations to Pass Information in a Tree

    Senior
  • Minimum Nodes to Delete for Tree Height K

    Senior
  • Minimum Subtree Sum Difference After Edge Removal

    Senior
  • Path in an Implicit Fibonacci Tree

    Senior
  • S-Expression Tree

    Senior
  • Serialize and Deserialize Binary Tree

    Senior
  • Serialize and Deserialize N-ary Tree

    Senior
  • Signal Propagation in Tree Network

    Senior
  • Vertical Order Traversal of a Binary Tree

    Senior