Binary Tree Interview Questions
Master 165 binary tree problems frequently asked in technical interviews. These questions test your understanding of binary treeconcepts and are essential for coding interview success.
165
Total Problems
37
Easy
116
Medium
12
Hard
#314MediumFrequency: 93.4%
Binary Tree Vertical Order Traversal
#1
Rank
#124HardFrequency: 90.2%
Binary Tree Maximum Path Sum
#2
Rank
#1790MediumFrequency: 88.5%
Lowest Common Ancestor of a Binary Tree III
#3
Rank
#543EasyFrequency: 86.8%
Diameter of Binary Tree
#4
Rank
#236MediumFrequency: 86.4%
Lowest Common Ancestor of a Binary Tree
#5
Rank
#199MediumFrequency: 85.4%
Binary Tree Right Side View
#6
Rank
#2217MediumFrequency: 83.7%
Step-By-Step Directions From a Binary Tree Node to Another
#7
Rank
#230MediumFrequency: 82.3%
Kth Smallest Element in a BST
#8
Rank
#9
Rank
#975EasyFrequency: 78%
Range Sum of BST
#10
Rank
#366MediumFrequency: 76.7%
Find Leaves of Binary Tree
#11
Rank
#12
Rank
#1029HardFrequency: 69.1%
Vertical Order Traversal of a Binary Tree
#13
Rank
#235MediumFrequency: 66.5%
Lowest Common Ancestor of a Binary Search Tree
#14
Rank
#893MediumFrequency: 65.7%
All Nodes Distance K in Binary Tree
#15
Rank
#108EasyFrequency: 65.5%
Convert Sorted Array to Binary Search Tree
#16
Rank
#104EasyFrequency: 65%
Maximum Depth of Binary Tree
#17
Rank
#758MediumFrequency: 63.7%
Convert Binary Search Tree to Sorted Doubly Linked List
#18
Rank
#101EasyFrequency: 63.4%
Symmetric Tree
#19
Rank
#297HardFrequency: 63.4%
Serialize and Deserialize Binary Tree
#20
Rank
#2584MediumFrequency: 62.5%
Number of Nodes With Value One
#21
Rank
#270EasyFrequency: 61.8%
Closest Binary Search Tree Value
#22
Rank
#272HardFrequency: 61.6%
Closest Binary Search Tree Value II
#23
Rank
#743MediumFrequency: 61.1%
Closest Leaf in a Binary Tree
#24
Rank
#173MediumFrequency: 60.9%
Binary Search Tree Iterator
#25
Rank
#671EasyFrequency: 60.7%
Second Minimum Node In a Binary Tree
#26
Rank
#2175MediumFrequency: 59.9%
Count Nodes With the Highest Score
#27
Rank
#105MediumFrequency: 59.3%
Construct Binary Tree from Preorder and Inorder Traversal
#28
Rank
#103MediumFrequency: 55.5%
Binary Tree Zigzag Level Order Traversal
#29
Rank
#102MediumFrequency: 54.4%
Binary Tree Level Order Traversal
#30
Rank
#998MediumFrequency: 54.4%
Check Completeness of a Binary Tree
#31
Rank
#32
Rank
#2461MediumFrequency: 52.9%
Amount of Time for Binary Tree to Be Infected
#33
Rank
#662MediumFrequency: 52.9%
Maximum Width of Binary Tree
#34
Rank
#98MediumFrequency: 52.8%
Validate Binary Search Tree
#35
Rank
#2347MediumFrequency: 52.7%
Count Nodes Equal to Average of Subtree
#36
Rank
#337MediumFrequency: 52.1%
House Robber III
#37
Rank
#1780MediumFrequency: 50.6%
Lowest Common Ancestor of a Binary Tree II
#38
Rank
#39
Rank
#40
Rank
#116MediumFrequency: 48.8%
Populating Next Right Pointers in Each Node
#41
Rank
#617EasyFrequency: 48.8%
Merge Two Binary Trees
#42
Rank
#257EasyFrequency: 48.7%
Binary Tree Paths
#43
Rank
#100EasyFrequency: 48.1%
Same Tree
#44
Rank
#536MediumFrequency: 47.5%
Construct Binary Tree from String
#45
Rank
#2306MediumFrequency: 47.5%
Create Binary Tree From Descriptions
#46
Rank
#515MediumFrequency: 44.7%
Find Largest Value in Each Tree Row
#47
Rank
#94EasyFrequency: 44.2%
Binary Tree Inorder Traversal
#48
Rank
#298MediumFrequency: 44%
Binary Tree Longest Consecutive Sequence
#49
Rank
#50
Rank
#226EasyFrequency: 43%
Invert Binary Tree
#51
Rank
#255MediumFrequency: 41.2%
Verify Preorder Sequence in Binary Search Tree
#52
Rank
#789EasyFrequency: 40.8%
Kth Largest Element in a Stream
#53
Rank
#112EasyFrequency: 40.5%
Path Sum
#54
Rank
#114MediumFrequency: 40.5%
Flatten Binary Tree to Linked List
#55
Rank
#1207MediumFrequency: 40.2%
Delete Nodes And Return Forest
#56
Rank
#117MediumFrequency: 40%
Populating Next Right Pointers in Each Node II
#57
Rank
#99MediumFrequency: 39.4%
Recover Binary Search Tree
#58
Rank
#1653MediumFrequency: 39.1%
Number of Good Leaf Nodes Pairs
#59
Rank
#2780MediumFrequency: 39.1%
Make Costs of Paths Equal in a Binary Tree
#60
Rank
#61
Rank
#896MediumFrequency: 38.5%
Smallest Subtree with all the Deepest Nodes
#62
Rank
#106MediumFrequency: 38.2%
Construct Binary Tree from Inorder and Postorder Traversal
#63
Rank
#1050MediumFrequency: 37.4%
Construct Binary Search Tree from Preorder Traversal
#64
Rank
#96MediumFrequency: 36.8%
Unique Binary Search Trees
#65
Rank
#653EasyFrequency: 35.7%
Two Sum IV - Input is a BST
#66
Rank
#1544MediumFrequency: 35.7%
Count Good Nodes in Binary Tree
#67
Rank
#930MediumFrequency: 35.6%
All Possible Full Binary Trees
#68
Rank
#1008HardFrequency: 35.1%
Binary Tree Cameras
#69
Rank
#1475HardFrequency: 35.1%
Maximum Sum BST in Binary Tree
#70
Rank
#1218MediumFrequency: 34%
Lowest Common Ancestor of Deepest Leaves
#71
Rank
#1254MediumFrequency: 33%
Deepest Leaves Sum
#72
Rank
#572EasyFrequency: 31.9%
Subtree of Another Tree
#73
Rank
#1114MediumFrequency: 31.3%
Binary Search Tree to Greater Sum Tree
#74
Rank
#2545HardFrequency: 31.1%
Height of Binary Tree After Subtree Removal Queries
#75
Rank
#1465MediumFrequency: 31.1%
Maximum Product of Splitted Binary Tree
#76
Rank
#652MediumFrequency: 30.4%
Find Duplicate Subtrees
#77
Rank
#513MediumFrequency: 29.3%
Find Bottom Left Tree Value
#78
Rank
#784MediumFrequency: 29.3%
Insert into a Binary Search Tree
#79
Rank
#2646MediumFrequency: 29.1%
Kth Largest Sum in a Binary Tree
#80
Rank
#530EasyFrequency: 28.9%
Minimum Absolute Difference in BST
#81
Rank
#1116MediumFrequency: 28.1%
Maximum Level Sum of a Binary Tree
#82
Rank
#95MediumFrequency: 28.1%
Unique Binary Search Trees II
#83
Rank
#404EasyFrequency: 28.1%
Sum of Left Leaves
#84
Rank
#1093HardFrequency: 27.8%
Recover a Tree From Preorder Traversal
#85
Rank
#1285MediumFrequency: 27.8%
Balance a Binary Search Tree
#86
Rank
#1768MediumFrequency: 27.8%
Design an Expression Tree With Evaluate Function
#87
Rank
#109MediumFrequency: 27.7%
Convert Sorted List to Binary Search Tree
#88
Rank
#285MediumFrequency: 27.3%
Inorder Successor in BST
#89
Rank
#333MediumFrequency: 27.3%
Largest BST Subtree
#90
Rank
#654MediumFrequency: 27.3%
Maximum Binary Tree
#91
Rank
#1609EasyFrequency: 27.3%
Find All The Lonely Nodes
#92
Rank
#3467MediumFrequency: 27.3%
Find the Level of Tree with Minimum Sum
#93
Rank
#144EasyFrequency: 27.2%
Binary Tree Preorder Traversal
#94
Rank
#222MediumFrequency: 27.2%
Count Complete Tree Nodes
#95
Rank
#1498EasyFrequency: 26.7%
Find a Corresponding Node of a Binary Tree in a Clone of That Tree
#96
Rank
#508MediumFrequency: 26.5%
Most Frequent Subtree Sum
#97
Rank
#1092MediumFrequency: 26.5%
Maximum Difference Between Node and Ancestor
#98
Rank
#1624MediumFrequency: 26.5%
Clone Binary Tree With Random Pointer
#99
Rank
#1816MediumFrequency: 26.5%
Lowest Common Ancestor of a Binary Tree IV
#100
Rank
#2677MediumFrequency: 26.5%
Cousins in Binary Tree II
#101
Rank
#501EasyFrequency: 25.4%
Find Mode in Binary Search Tree
#102
Rank
#783EasyFrequency: 25.4%
Search in a Binary Search Tree
#103
Rank
#107MediumFrequency: 25.3%
Binary Tree Level Order Traversal II
#104
Rank
#449MediumFrequency: 25.1%
Serialize and Deserialize BST
#105
Rank
#538MediumFrequency: 25.1%
Convert BST to Greater Tree
#106
Rank
#1079EasyFrequency: 25.1%
Sum of Root To Leaf Binary Numbers
#107
Rank
#1243MediumFrequency: 25.1%
Sum of Nodes with Even-Valued Grandparent
#108
Rank
#2558MediumFrequency: 25.1%
Minimum Number of Operations to Sort a Binary Tree by Level
#109
Rank
#637EasyFrequency: 25.1%
Average of Levels in Binary Tree
#110
Rank
#1275MediumFrequency: 25.1%
Validate Binary Tree Nodes
#111
Rank
#1729MediumFrequency: 25.1%
Binary Search Tree Iterator II
#112
Rank
#111EasyFrequency: 25%
Minimum Depth of Binary Tree
#113
Rank
#925MediumFrequency: 24.4%
Construct Binary Tree from Preorder and Postorder Traversal
#114
Rank
#1150MediumFrequency: 23.6%
Two Sum BSTs
#115
Rank
#1427MediumFrequency: 23.6%
All Elements in Two Binary Search Trees
#116
Rank
#1883MediumFrequency: 23.6%
Find Distance in a Binary Tree
#117
Rank
#118
Rank
#119
Rank
#988MediumFrequency: 23.3%
Flip Equivalent Binary Trees
#120
Rank
#1030MediumFrequency: 23.3%
Smallest String Starting From Leaf
#121
Rank
#606MediumFrequency: 21.9%
Construct String from Binary Tree
#122
Rank
#1021MediumFrequency: 21.9%
Distribute Coins in Binary Tree
#123
Rank
#1157MediumFrequency: 21.9%
Insufficient Nodes in Root to Leaf Paths
#124
Rank
#1450MediumFrequency: 21.9%
Delete Leaves With a Given Value
#125
Rank
#2126MediumFrequency: 21.5%
Count Nodes Equal to Sum of Descendants
#126
Rank
#127
Rank
#145EasyFrequency: 20.9%
Binary Tree Postorder Traversal
#128
Rank
#331MediumFrequency: 20.9%
Verify Preorder Serialization of a Binary Tree
#129
Rank
#2567MediumFrequency: 20.9%
Closest Nodes Queries in a Binary Search Tree
#130
Rank
#2416EasyFrequency: 20.9%
Evaluate Boolean Binary Tree
#131
Rank
#549MediumFrequency: 20.3%
Binary Tree Longest Consecutive Sequence II
#132
Rank
#133
Rank
#134
Rank
#135
Rank
#1568MediumFrequency: 20%
Pseudo-Palindromic Paths in a Binary Tree
#136
Rank
#1736HardFrequency: 20%
Build Binary Expression Tree From Infix Expression
#137
Rank
#799EasyFrequency: 19.5%
Minimum Distance Between BST Nodes
#138
Rank
#139
Rank
#140
Rank
#1692HardFrequency: 18%
Number of Ways to Reorder Array to Get Same BST
#141
Rank
#669MediumFrequency: 18%
Trim a Binary Search Tree
#142
Rank
#687MediumFrequency: 16.4%
Longest Univalue Path
#143
Rank
#955MediumFrequency: 16.4%
Complete Binary Tree Inserter
#144
Rank
#1248MediumFrequency: 16.4%
Binary Tree Coloring Game
#145
Rank
#1387MediumFrequency: 16.4%
Find Elements in a Contaminated Binary Tree
#146
Rank
#1745MediumFrequency: 16.4%
Find Nearest Right Node in Binary Tree
#147
Rank
#1750MediumFrequency: 16.4%
Check If Two Expression Trees are Equivalent
#148
Rank
#1796MediumFrequency: 16.4%
Correct a Binary Tree
#149
Rank
#1810MediumFrequency: 16.4%
Change the Root of a Binary Tree
#150
Rank
#2399HardFrequency: 16.4%
Minimum Flips in Binary Tree to Get Result
#151
Rank
#2843EasyFrequency: 16.4%
Extract Kth Character From The Rope Tree
#152
Rank
#1035EasyFrequency: 15.7%
Cousins in Binary Tree
#153
Rank
#154
Rank
#655MediumFrequency: 12.6%
Print Binary Tree
#155
Rank
#2493MediumFrequency: 12.6%
Reverse Odd Levels of Binary Tree
#156
Rank
#2060HardFrequency: 12%
Merge BSTs to Create Single BST
#157
Rank
#933EasyFrequency: 10.5%
Increasing Order Search Tree
#158
Rank
#1005EasyFrequency: 10.5%
Univalued Binary Tree
#159
Rank
#250MediumFrequency: 10.3%
Count Univalue Subtrees
#160
Rank
#1484MediumFrequency: 8%
Linked List in Binary Tree
#161
Rank
#1474MediumFrequency: 7.3%
Longest ZigZag Path in a Binary Tree
#162
Rank
#163
Rank
#3509MediumFrequency: 5.5%
K-th Largest Perfect Subtree Size in Binary Tree
#164
Rank
#623MediumFrequency: 5%
Add One Row to Tree
#165
Rank
Master Binary Tree in Real Interviews
Get AI-powered assistance when solving binary tree problems during your actual interviews.
Get Started FreeNo credit card required