## 5 stories

Given a node in a binary tree, implement the algorithm for finding its next in-order node in the containing tree.

511 views

You have a directed connected graph. Write an algorithm that detects any cycle, if one exists, and returns a list of its nodes.

556 views

Given a Singly Linked List, write an algorithm to find the middle node. You may not use more than one loop of any kind.

492 views

A linked list is given. Write an algorithm that detects whether it's a singly linked list or a circularly linked list.

454 views