Rohan
BAN USER
Comments (8)
Reputation 25
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
A Linked list.(Each node can point to the previous and next node).It is easier to add nodes to the end of a linked list. If you use an array you would either need to resize it or initialise it to the maximum possible snake length to start(which is a waste of memory)
- Rohan July 25, 2011Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
1)Serialize both trees
- Rohan March 06, 20122)Merge sort
3)Convert Merged Doubly Linked List to a Balanced BST