Algorithms | K5kC | Code & More

Find the depth of a node in a binary tree

Find the height of a node in a binary tree

Given preorder traversal of a BST, check if each non-leaf node has only one child

Implement circular linked list

Implement Hierarchical Locking System for Tree Structures

Implement queue using linked list

Implementing a queue using a fixed-size array

Insert into a Binary Search Tree

Interval Scheduling Problem

K closest Points to Origin