# 2009-GHP-RM-WEB-FT Cookie Jar: Linked Lists, Stacks, Queues ## Put your questions in a '##' tag below :point_down: ## is it the pointer itself that takes extra space or the structure (node with prev and next pointer) that takes up more space than a regular element? ## Answer Good question. The structure itself takes up more space because of the combo of the pointers (prev, next) and the value that the node contains ## are we going to learn about graph in this course? ## Answer Yes! In Senior Phase! ## if a binary search tree is not ordered, is it longer a binary search tree? can we still use it if it's unordered? ## Answer Good question. If each node has at most 2 children nodes, then it's just a Binary Tree. Binary *Search* Trees are one derivative of a Binary Tree. Yes, we can absolutely use it if it's not ordered! Yesterday, I linked to a [Stackoverflow link that notes some use cases of Binary Trees](https://stackoverflow.com/questions/2130416/what-are-the-applications-of-binary-trees). If the each node has more than two nodes, then we are looking at an n-ary tree, where a node can have at max n children. So, if a node has 3 children, then it's a tertiary tree. We will learn about these in Senior Phase.