javascript

Tree: Inorder Traversal is a coding challenge with easy difficulty in the HackerRank data structures category. In this blog post, we’ll discuss how we can solve it in JavaScript in O(n) time and O(1) space. Problem Statement In this challenge, you are required to implement inorder traversal of a tree. Complete the inOrder function in your editor … Read more

Tree: Postorder Traversal is a coding challenge with easy difficulty in the HackerRank data structures category. In this blog post, we’ll discuss how we can solve it in JavaScript in O(n) time and O(1) space. Problem Statement Complete the postOrder function in the editor below. It received  parameter: a pointer to the root of a binary tree. It … Read more

Tree: Preorder Traversal is a coding challenge with easy difficulty in the HackerRank data structures category. In this blog post, we’ll discuss how we can solve it in JavaScript in O(n) time and O(1) space. Problem Statement Complete the preOrder function in the editor below, which has  parameter: a pointer to the root of a binary tree. It … Read more

Reverse a doubly linked list is a coding challenge with easy difficulty in the HackerRank data structures category. In this blog post, we’ll discuss how we can solve it in JavaScript in O(n) time and O(1) space. Problem Statement Given the pointer to the head node of a doubly linked list, reverse the order of … Read more

Inserting a Node Into a Sorted Doubly Linked List is a coding challenge with easy difficulty in the HackerRank data structures category. In this blog post, we’ll discuss how we can solve it in JavaScript in O(n) time and O(1) space. Problem Statement Given a reference to the head of a doubly-linked list and an … Read more