Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Largest BST Subtree
Bookmark
Validate Each Node
Post-Order
Input
Standard (size 3)
Entire tree is BST
Complex
Custom
tree
=
[10, 5, 15, 1, 8, null, 7]
maxSize = 0
10
5
15
1
8
7
Call Stack
empty
Current
Valid BST
Not a BST
Largest BST
maxSize = 0
10
5
15
1
8
7
Call Stack
empty
Current
Valid BST
Not a BST
Largest BST
maxSize = 0
10
5
15
1
8
7
node
Call Stack
largestBSTSubtree(10)
Current
Valid BST
Not a BST
Largest BST
maxSize = 0
10
5
15
1
8
7
node
Call Stack
largestBSTSubtree(5)
largestBSTSubtree(10)
Current
Valid BST
Not a BST
Largest BST
maxSize = 0
10
5
15
1
8
7
node
Call Stack
largestBSTSubtree(5)
largestBSTSubtree(10)
Current
Valid BST
Not a BST
Largest BST
maxSize = 3
10
5
15
1
8
7
node
Call Stack
largestBSTSubtree(15)
largestBSTSubtree(10)
Current
Valid BST
Not a BST
Largest BST
maxSize = 3
10
5
15
1
8
7
node
Call Stack
largestBSTSubtree(15)
largestBSTSubtree(10)
Current
Valid BST
Not a BST
Largest BST
maxSize = 3
10
5
15
1
8
7
node
Call Stack
largestBSTSubtree(15)
largestBSTSubtree(10)
Current
Valid BST
Not a BST
Largest BST
maxSize = 3
10
5
15
1
8
7
node
Call Stack
largestBSTSubtree(7)
largestBSTSubtree(15)
largestBSTSubtree(10)
Current
Valid BST
Not a BST
Largest BST
maxSize = 3
10
5
15
1
8
7
node
Call Stack
largestBSTSubtree(15)
largestBSTSubtree(10)
Current
Valid BST
Not a BST
Largest BST
maxSize = 3
10
5
15
1
8
7
Call Stack
empty
Current
Valid BST
Not a BST
Largest BST
algo
master
.
io
Step:
Start: check every node as the root of a possible BST
0 / 22
Input
Standard (size 3)
Entire tree is BST
Complex
Custom
tree
=
[10, 5, 15, 1, 8, null, 7]
0 / 22
algo
master
.
io
Step:
Start: check every node as the root of a possible BST
