Store the nodes to an array.
For each element, tne next element is the inorder successor.
Subscribe to:
Post Comments (Atom)
Design and implementation of interesting data structures and algorithms. You may find it useful either in your computer science course curriculum or in technical interviews of companies like Microsoft, Amazon, Google, Yahoo, Sun, Oracle etc
No comments:
Post a Comment