M: Difference between revisions
mNo edit summary |
No edit summary |
||
| Line 15: | Line 15: | ||
To really appreciate MUMPS, you need to understand '''[[b:Data_Structures/Trees|trees]]''' (the [[:en:Data_structure|data structure]] in computer science) including binary search trees<ref>https://en.wikipedia.org/wiki/Category:Binary_trees</ref> and [[Wikipedia:B-tree|B-trees]] This means you'll also be dealing with '''[[:en:Stack_(abstract_data_type)|stacks]]''' ([[b:Data_Structures/Stacks_and_Queues| | To really appreciate MUMPS, you need to understand '''[[b:Data_Structures/Trees|trees]]''' (the [[:en:Data_structure|data structure]] in computer science) including binary search trees<ref>https://en.wikipedia.org/wiki/Category:Binary_trees</ref> and [[Wikipedia:B-tree|B-trees]] This means you'll also be dealing with '''[[:en:Stack_(abstract_data_type)|stacks]]''' ([[b:Data_Structures/Stacks_and_Queues|Data Structures/Stacks and Queues]]) | ||
== Learn more == | == Learn more == | ||