- Write a function that accepts the head node of a linked list, reverses it and returns the new head node.
- Write a program to implement a doubly linked list. We would need to define the structure, and implement add and delete node functions.
- Write a program to create a binary search tree.
- Add a delete function to the previous binary search tree code, which removes a node.
- Add functions to traverse the tree and print its values. You can try different tree traversals.
Introduction
0/12
Types, Operators and Expressions
0/13
Control Flow
0/8
Functions and Program Structure
0/11
Pointers and Arrays
0/13
Structures
0/7
Input and Output
0/9
The UNIX System Interface
0/9