Could I get help understanding the listed concepts in java?

Sorting Algorithms/Recursion (Week 9) Examples of questions regarding recursion are:

- Given an iterative method (using a loop), you will be asked to write a recursive method that produces the same result. Or vice versa.

- Given a recursive method, compute the result/output based on certain parameter values.

- How merge sort and quick sort works using recursion

Linked Lists, Stacks, and Queues (Week 10, Week 11)

Given code using linked lists, stacks, or queues, trace its output : similar to in class activities

You need to know how these data structures work, how an element can be added or removed

Review the methods in the LinkedList that we saw in class. You might be asked to write code similar to those ones (possibly different setting).

Know the complexity (efficiency) of access and add/remove operations on array lists vs. linked lists

Know the difference between static data structures and dynamic data structures

Binary trees (Week 12/13)

-Know the meaning of: root, leaves, parent, right child, left child, siblings

-Be able to perform Pre-Order, In-Order, and Post-Order traversals of any binary tree.

Binary Search Trees (Week 12/13)

a special kind of binary trees with the binary search property.

-How to create a binary search tree if a data set is given

- binary search tree traversal

- linked list based implementation of the binary search tree (insert, tree traversal)

Heaps (Week 12/13)

-Know the definition of heaps

-Understand how a heap can be represented using an array, and how to obtain parents, right-children, leftchildren for nodes using indexes of an array