Binary Tree
Binary Tree¶
- 998. Maximum Binary Tree II
- 993. Cousins in Binary Tree
- 99. Recover Binary Search Tree
- 988. Smallest String Starting From Leaf
- 987. Vertical Order Traversal of a Binary Tree
- 98. Validate Binary Search Tree
- 979. Distribute Coins in Binary Tree
- 971. Flip Binary Tree To Match Preorder Traversal
- 968. Binary Tree Cameras
- 965. Univalued Binary Tree
- 96. Unique Binary Search Trees
- 958. Check Completeness of a Binary Tree
- 951. Flip Equivalent Binary Trees
- 95. Unique Binary Search Trees II
- 94. Binary Tree Inorder Traversal
- 938. Range Sum of BST
- 919. Complete Binary Tree Inserter
- 897. Increasing Order Search Tree
- 894. All Possible Full Binary Trees
- 889. Construct Binary Tree from Preorder and Postorder Traversal
- 872. Leaf-Similar Trees
- 865. Smallest Subtree with all the Deepest Nodes
- 863. All Nodes Distance K in Binary Tree
- 814. Binary Tree Pruning
- 783. Minimum Distance Between BST Nodes
- 776. Split BST
- 742. Closest Leaf in a Binary Tree
- 703. Kth Largest Element in a Stream
- 701. Insert into a Binary Search Tree
- 700. Search in a Binary Search Tree
- 687. Longest Univalue Path
- 671. Second Minimum Node In a Binary Tree
- 669. Trim a Binary Search Tree
- 666. Path Sum IV
- 663. Equal Tree Partition
- 662. Maximum Width of Binary Tree
- 655. Print Binary Tree
- 654. Maximum Binary Tree
- 653. Two Sum IV - Input is a BST
- 652. Find Duplicate Subtrees
- 637. Average of Levels in Binary Tree
- 623. Add One Row to Tree
- 617. Merge Two Binary Trees
- 606. Construct String from Binary Tree
- 572. Subtree of Another Tree
- 563. Binary Tree Tilt
- 549. Binary Tree Longest Consecutive Sequence II
- 545. Boundary of Binary Tree
- 543. Diameter of Binary Tree
- 538. Convert BST to Greater Tree
- 536. Construct Binary Tree from String
- 530. Minimum Absolute Difference in BST
- 515. Find Largest Value in Each Tree Row
- 513. Find Bottom Left Tree Value
- 510. Inorder Successor in BST II
- 508. Most Frequent Subtree Sum
- 501. Find Mode in Binary Search Tree
- 450. Delete Node in a BST
- 449. Serialize and Deserialize BST
- 437. Path Sum III
- 431. Encode N-ary Tree to Binary Tree
- 426. Convert Binary Search Tree to Sorted Doubly Linked List
- 404. Sum of Left Leaves
- 366. Find Leaves of Binary Tree
- 337. House Robber III
- 333. Largest BST Subtree
- 3319. K-th Largest Perfect Subtree Size in Binary Tree
- 331. Verify Preorder Serialization of a Binary Tree
- 3157. Find the Level of Tree with Minimum Sum
- 314. Binary Tree Vertical Order Traversal
- 298. Binary Tree Longest Consecutive Sequence
- 297. Serialize and Deserialize Binary Tree
- 285. Inorder Successor in BST
- 2792. Count Nodes That Are Great Enough
- 2773. Height of Special Binary Tree
- 2764. Is Array a Preorder of Some Binary Tree
- 272. Closest Binary Search Tree Value II
- 270. Closest Binary Search Tree Value
- 2689. Extract Kth Character From The Rope Tree
- 2673. Make Costs of Paths Equal in a Binary Tree
- 2641. Cousins in Binary Tree II
- 2583. Kth Largest Sum in a Binary Tree
- 257. Binary Tree Paths
- 255. Verify Preorder Sequence in Binary Search Tree
- 2509. Cycle Length Queries in a Tree
- 250. Count Univalue Subtrees
- 2476. Closest Nodes Queries in a Binary Search Tree
- 2471. Minimum Number of Operations to Sort a Binary Tree by Level
- 2458. Height of Binary Tree After Subtree Removal Queries
- 2445. Number of Nodes With Value One
- 2415. Reverse Odd Levels of Binary Tree
- 2385. Amount of Time for Binary Tree to Be Infected
- 236. Lowest Common Ancestor of a Binary Tree
- 235. Lowest Common Ancestor of a Binary Search Tree
- 2331. Evaluate Boolean Binary Tree
- 2313. Minimum Flips in Binary Tree to Get Result
- 230. Kth Smallest Element in a BST
- 2265. Count Nodes Equal to Average of Subtree
- 226. Invert Binary Tree
- 2236. Root Equals Sum of Children
- 222. Count Complete Tree Nodes
- 2196. Create Binary Tree From Descriptions
- 2096. Step-By-Step Directions From a Binary Tree Node to Another
- 2049. Count Nodes With the Highest Score
- 2005. Subtree Removal Game with Fibonacci Tree
- 199. Binary Tree Right Side View
- 1973. Count Nodes Equal to Sum of Descendants
- 1932. Merge BSTs to Create Single BST
- 1902. Depth of BST Given Insertion Order
- 1740. Find Distance in a Binary Tree
- 173. Binary Search Tree Iterator
- 1676. Lowest Common Ancestor of a Binary Tree IV
- 1666. Change the Root of a Binary Tree
- 1660. Correct a Binary Tree
- 1650. Lowest Common Ancestor of a Binary Tree III
- 1644. Lowest Common Ancestor of a Binary Tree II
- 1628. Design an Expression Tree With Evaluate Function
- 1612. Check If Two Expression Trees are Equivalent
- 1609. Even Odd Tree
- 1602. Find Nearest Right Node in Binary Tree
- 1597. Build Binary Expression Tree From Infix Expression
- 1586. Binary Search Tree Iterator II
- 1569. Number of Ways to Reorder Array to Get Same BST
- 156. Binary Tree Upside Down
- 1530. Number of Good Leaf Nodes Pairs
- 1485. Clone Binary Tree With Random Pointer
- 1469. Find All The Lonely Nodes
- 1457. Pseudo-Palindromic Paths in a Binary Tree
- 145. Binary Tree Postorder Traversal
- 1448. Count Good Nodes in Binary Tree
- 144. Binary Tree Preorder Traversal
- 1430. Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
- 1382. Balance a Binary Search Tree
- 1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree
- 1373. Maximum Sum BST in Binary Tree
- 1372. Longest ZigZag Path in a Binary Tree
- 1367. Linked List in Binary Tree
- 1361. Validate Binary Tree Nodes
- 1339. Maximum Product of Splitted Binary Tree
- 1325. Delete Leaves With a Given Value
- 1315. Sum of Nodes with Even-Valued Grandparent
- 1305. All Elements in Two Binary Search Trees
- 1302. Deepest Leaves Sum
- 129. Sum Root to Leaf Numbers
- 1261. Find Elements in a Contaminated Binary Tree
- 124. Binary Tree Maximum Path Sum
- 1214. Two Sum BSTs
- 117. Populating Next Right Pointers in Each Node II
- 1161. Maximum Level Sum of a Binary Tree
- 116. Populating Next Right Pointers in Each Node
- 1145. Binary Tree Coloring Game
- 114. Flatten Binary Tree to Linked List
- 113. Path Sum II
- 1123. Lowest Common Ancestor of Deepest Leaves
- 1120. Maximum Average Subtree
- 112. Path Sum
- 1110. Delete Nodes And Return Forest
- 111. Minimum Depth of Binary Tree
- 1104. Path In Zigzag Labelled Binary Tree
- 110. Balanced Binary Tree
- 109. Convert Sorted List to Binary Search Tree
- 1080. Insufficient Nodes in Root to Leaf Paths
- 108. Convert Sorted Array to Binary Search Tree
- 107. Binary Tree Level Order Traversal II
- 106. Construct Binary Tree from Inorder and Postorder Traversal
- 105. Construct Binary Tree from Preorder and Inorder Traversal
- 104. Maximum Depth of Binary Tree
- 1038. Binary Search Tree to Greater Sum Tree
- 103. Binary Tree Zigzag Level Order Traversal
- 1028. Recover a Tree From Preorder Traversal
- 1026. Maximum Difference Between Node and Ancestor
- 1022. Sum of Root To Leaf Binary Numbers
- 102. Binary Tree Level Order Traversal
- 101. Symmetric Tree
- 1008. Construct Binary Search Tree from Preorder Traversal
- 100. Same Tree