algo_061.md (307B)
1 # algo_061 2 3 ### Problem Statement 4 5 > Write an algorithm for finding the inorder successor helper node (`ins`) used in BST node deletion. 6 7 ## Algorithm 8 ``` 9 procedure ins(root) 10 begin 11 ptr ← RC(root); 12 while (LC(ptr) ≠ NULL) do 13 ptr ← LC(ptr); 14 endwhile 15 return ptr; 16 end procedure 17 ```