AlgoMaster Logo

Kth Smallest Element in a BST

tree=[3, 1, 4, null, 2],k=1
0 / 13
k: 13142Stack
algomaster.io
Step:Start: Find 1st smallest element in BST