## Binary tree traversal

Problem description : Tree traversal (a.k.a tree search) is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once, in a systematic way....

Skip to content# Tagged: data-structures

## Binary tree traversal

## Given a singly linked list find if it is palindrome

## Reverse a singly linked list

## Partition a linked list around a value

## Javascript linked list example

Problem description : Tree traversal (a.k.a tree search) is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once, in a systematic way....

Problem description : Write a function to determine if a singly linked list is a palindrome. Input : A linked list Output : Boolean (true or false) Approach 1: Reverse and compare the linked...

Problem description : Write a function to reverse a singly linked list. Input : A linked list Output : A linked list Logic : Iterate through linked list with three-pointers previous, current, next. While...

Problem description : Write code to partition a linked list around a value val, such that all nodes less than val come before all nodes greater than or equal to val. Input : A...

Challenge Problem : Implement LinkedList in javascript, with a following method: insertNodeAtTail – adds a node to the tail of a linked list. deleteNode – delets a node from the linked list and updates...