Problems Topics Tags Progress

Search

Home

|

Tag

|

O H

Problems with tag O(h)

153 found, showing 120 to 150

5

;

Path Sum III ->

Medium, #437, 4 solutions

Path Sum ->

Easy, #112, 2 solutions

Print Binary Tree ->

Medium, #655, 3 solutions

Pseudo-Palindromic Paths in a Binary Tree ->

Medium, #1457, 2 solutions

Range Sum of BST ->

Easy, #938, 2 solutions

Recover a Tree From Preorder Traversal ->

Hard, #1028, 3 solutions

Same Tree ->

Easy, #100, 4 solutions

Search in a Binary Search Tree ->

Easy, #700, 2 solutions

Second Minimum Node In a Binary Tree ->

Easy, #671, 3 solutions

Remove Node in Binary Search Tree ->

Hard, #87, 1 solutions

Segment Tree Build ->

Medium, #201, 1 solutions

Segment Tree Build II ->

Medium, #439, 1 solutions

Segment Tree Modify ->

Medium, #203, 1 solutions

Serialize and Deserialize Binary Tree ->

Hard, #297, 4 solutions

Serialize and Deserialize BST ->

Medium, #449, 3 solutions

Serialize and Deserialize N-ary Tree ->

Hard, #428, 3 solutions

Smallest String Starting From Leaf ->

Medium, #988, 3 solutions

Smallest Subtree with all the Deepest Nodes ->

Medium, #865, 2 solutions

Split BST ->

Medium, #776, 3 solutions

Step-By-Step Directions From a Binary Tree Node to Another ->

Medium, #2096, 2 solutions

Sum of Left Leaves ->

Easy, #404, 5 solutions

Sum of Nodes with Even-Valued Grandparent ->

Medium, #1315, 2 solutions

Sum of Root To Leaf Binary Numbers ->

Easy, #1022, 2 solutions

Search Range in Binary Search Tree ->

Medium, #11, 2 solutions

Symmetric Tree ->

Easy, #101, 4 solutions

Trim a Binary Search Tree ->

Medium, #669, 2 solutions

Segment Tree Query II ->

Hard, #247, 1 solutions

Segment Tree Query ->

Medium, #202, 1 solutions

Sum Root to Leaf Numbers ->

Medium, #129, 3 solutions

Two Sum IV - Input is a BST ->

Easy, #653, 3 solutions