Programming Reflections Mar 9

1. Create binary search tree from sorted array or linked list: It cannot access element via index in linked list as array, it uses direction to next node. Array creates root by middle term first, but linked list creates left subtree.

2. Multiple solutions for a problem help build connection with knowledge graph. (Linked list reverse and rotate can transfer to each other)

3. Stack and Recursion are both reverse way to process data.

4. Stack can work as parent pointer for tree problem.

5. MongoDB: nested structure, no schema, horizontal scaling (replica, shard), application driven, not engineering driven

6. Pivot/MVP: change strategy without changing vision

Advertisements

About liyao13

Yao Li is a web and iOS developer, blogger and he has a passion for technology and business. In his blogs, he shares code snippets, tutorials, resources and notes to help people develop their skills. Donate $5 to him for a coffee with PayPal at About Me page and read more professional and interesting technical blog articles. Follow him @Yaoli0615 at Twitter to get latest tech updates.
This entry was posted in CS Research&Application and tagged , , , , , . Bookmark the permalink.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s