Given a binary search tree and a node in it, find the in-order successor of that node in the BST.
Note: If the given node has no in-order successor in the tree, return
null.
Solution:
Use stack to do in-order traversal.
Round 2 solution:
No comments:
Post a Comment