From 5ca1350add080e41d6a01d7d35bfa90d28dd5d21 Mon Sep 17 00:00:00 2001
From: apil <078bct017.apil@pcampus.edu.np>
Date: Thu, 7 Mar 2024 21:00:26 +0545
Subject: [PATCH 01/10] initial commit

---
 src/algorithms/.gitkeep | 0
 1 file changed, 0 insertions(+), 0 deletions(-)
 create mode 100644 src/algorithms/.gitkeep

diff --git a/src/algorithms/.gitkeep b/src/algorithms/.gitkeep
new file mode 100644
index 0000000..e69de29

From 88541975ca9246657b564b73bd7ea9b3af1c62d9 Mon Sep 17 00:00:00 2001
From: Anoobee <aryalanup13@gmail.com>
Date: Thu, 7 Mar 2024 21:45:16 +0545
Subject: [PATCH 02/10] added doublylinklist

---
 src/algorithms/dll.js | 113 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 113 insertions(+)
 create mode 100644 src/algorithms/dll.js

diff --git a/src/algorithms/dll.js b/src/algorithms/dll.js
new file mode 100644
index 0000000..1f50184
--- /dev/null
+++ b/src/algorithms/dll.js
@@ -0,0 +1,113 @@
+class Node {
+  constructor(data) {
+    this.data = data;
+    this.prev = null;
+    this.next = null;
+  }
+}
+
+class DoublyLinkedList {
+  constructor() {
+    this.head = null;
+    this.tail = null;
+    this.size = 0;
+  }
+
+  isEmpty() {
+    return this.size === 0;
+  }
+
+  back() {
+    if (this.isEmpty()) {
+      return null;
+    }
+    return this.tail.data;
+  }
+
+  front() {
+    if (this.isEmpty()) {
+      return null;
+    }
+    return this.head.data;
+  }
+
+  pushBack(data) {
+    const newNode = new Node(data);
+    if (this.isEmpty()) {
+      this.head = newNode;
+      this.tail = newNode;
+    } else {
+      newNode.prev = this.tail;
+      this.tail.next = newNode;
+      this.tail = newNode;
+    }
+    this.size++;
+  }
+
+  pushFront(data) {
+    const newNode = new Node(data);
+    if (this.isEmpty()) {
+      this.head = newNode;
+      this.tail = newNode;
+    } else {
+      newNode.next = this.head;
+      this.head.prev = newNode;
+      this.head = newNode;
+    }
+    this.size++;
+  }
+
+  popBack() {
+    if (this.isEmpty()) {
+      return null;
+    }
+    const removedData = this.tail.data;
+    if (this.size === 1) {
+      this.head = null;
+      this.tail = null;
+    } else {
+      this.tail = this.tail.prev;
+      this.tail.next = null;
+    }
+    this.size--;
+    return removedData;
+  }
+
+  popFront() {
+    if (this.isEmpty()) {
+      return null;
+    }
+    const removedData = this.head.data;
+    if (this.size === 1) {
+      this.head = null;
+      this.tail = null;
+    } else {
+      this.head = this.head.next;
+      this.head.prev = null;
+    }
+    this.size--;
+    return removedData;
+  }
+
+  display() {
+    let current = this.head;
+    while (current) {
+      console.log(current.data);
+      current = current.next;
+    }
+  }
+}
+
+export default DoublyLinkedList;
+// // Example usage:
+// const dll = new DoublyLinkedList();
+// dll.pushBack(1);
+// dll.pushBack("anup");
+// dll.pushBack(3);
+// dll.display(); // Output: 1 anup 3
+// console.log("Front:", dll.front()); // Output: Front: 1
+// console.log("Back:", dll.back()); // Output: Back: 3
+// dll.popBack();
+// dll.display(); // Output: 1 anup
+// dll.popFront();
+// dll.display(); // Output: anup

From fd4c58d7c2fbb0ef824cc821901a34a204cbc35e Mon Sep 17 00:00:00 2001
From: Anoobee <aryalanup13@gmail.com>
Date: Fri, 8 Mar 2024 00:14:13 +0545
Subject: [PATCH 03/10] random

---
 src/Player/AudioData.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/Player/AudioData.js b/src/Player/AudioData.js
index 07530d6..e7301a3 100644
--- a/src/Player/AudioData.js
+++ b/src/Player/AudioData.js
@@ -16,7 +16,7 @@ const songsdata = [
         "url": song3
     }
 ]
-export { songsdata };
+export { songsdata }; // change hello 
 
 //Better Data
 // let savage = {

From fd5a650a2c297ce2931e6939cabd7092dbe73c39 Mon Sep 17 00:00:00 2001
From: apil <078bct017.apil@pcampus.edu.np>
Date: Fri, 8 Mar 2024 00:55:28 +0545
Subject: [PATCH 04/10] first draft red_black_tree

---
 src/algorithms/red_black_tree.js | 221 +++++++++++++++++++++++++++++++
 1 file changed, 221 insertions(+)
 create mode 100644 src/algorithms/red_black_tree.js

diff --git a/src/algorithms/red_black_tree.js b/src/algorithms/red_black_tree.js
new file mode 100644
index 0000000..2ebce64
--- /dev/null
+++ b/src/algorithms/red_black_tree.js
@@ -0,0 +1,221 @@
+class RBT_Node {
+  constructor(key, value) {
+    this.key = key;
+    this.value = value;
+    this.left = null;
+    this.right = null;
+    this.parent = null;
+    this.black = false;
+    this.isLeftChild = false;
+  }
+}
+
+//balanced binary search tree uses color labels of node for rebalancing
+class RedBlackTree {
+  constructor() {
+    this.root = null;
+    this.height = 0;
+    this.size = 0;
+  }
+
+  add(key, value) {
+    const node = new RBT_Node(key, value);
+    if (this.root == null) {
+      this.root = node;
+      this.root.black = true;
+      this.size++;
+      return;
+    }
+    this.insert(this.root, node);
+    this.size++;
+  }
+
+  insert(parent, newNode) {
+    if (this.isKeyGreater(newNode, parent)) {
+      if (parent.right == null) {
+        parent.right = newNode;
+        newNode.parent = parent;
+        newNode.isLeftChild = false;
+      } else {
+        this.insert(parent.right, newNode);
+      }
+    } else {
+      if (parent.left == null) {
+        parent.left = newNode;
+        newNode.parent = parent;
+        newNode.isLeftChild = true;
+      } else {
+        this.insert(parent.left, newNode);
+      }
+    }
+    this.checkColor(newNode);
+    return;
+  }
+
+  //checks for if two consecutive trees are red
+  checkColor(node) {
+    if (node == this.root) {
+      return;
+    }
+    if (!node.black && !node.parent.black) {
+      this.correctTree(node);
+    }
+    this.checkColor(node.parent);
+  }
+
+  //corrects tree
+  correctTree(node) {
+    if (node.parent.isLeftChild) {
+      //aunt is grandparent's irght
+      if (node.parent.parent.right == null || node.parent.parent.right.black) {
+        //rotation
+        this.rotate(node);
+        return;
+      }
+      if (node.parent.parent.right != null) {
+        node.parent.parent.right.black = true;
+      }
+      node.parent.parent.black = false;
+      node.parent.black = true;
+      return;
+    }
+
+    //aunt is grandparent's left i.e. parent is rightChild of node
+    if (node.parent.parent.left == null || node.parent.parent.left.black) {
+      //rotation
+      this.rotate(node);
+      return;
+    }
+    if (node.parent.parent.left != null) {
+      node.parent.parent.left.black = true;
+    }
+    node.parent.parent.black = false;
+    node.parent.black = true;
+    return;
+  }
+
+  //interface for calling which type of rotation
+  rotate(node) {
+    if (node.isLeftChild) {
+      if (node.parent.isLeftChild) {
+        //actual rotation is done with respect to grandparent
+        this.rightRotate(node.parent.parent);
+        node.parent.black = true;
+        node.black = false;
+        //set sibling red
+        if (node.parent.right != null) {
+          node.parent.right.black = true;
+        }
+        return;
+      }
+      //is node is left but node's parent is right child
+      this.rightLeftRotate(node.parent.parent);
+      node.black = true;
+      node.right.black = false;
+      node.left.black = false;
+      return;
+    }
+    //node and node's parent both are right child
+    if (!node.parent.isLeftChild) {
+      this.leftRotate(node.parent.parent);
+      node.black = false;
+      node.parent.black = true;
+      if (node.parent.left != null) {
+        node.parent.left.black = false;
+      }
+      return;
+    }
+    this.leftRightRotate(node.parent.parent);
+    node.black = true;
+    node.right.black = false;
+    node.left.black = false;
+    return;
+  }
+
+  //grandparent node passed of node which disturbed balance
+  leftRotate(node) {
+    //RR heavy tree
+    const temp = node.right;
+    node.right = temp.left;
+    if (node.right != null) {
+      node.right.parent = node;
+      node.right.isLeftChild = false;
+    }
+    if (node.parent == null) {
+      this.root = temp;
+      temp.parent = null;
+    } else {
+      temp.parent = node.parent;
+      if (node.isLeftChild) {
+        temp.isLeftChild = true;
+        node.parent.left = temp;
+      } else {
+        temp.isLeftChild = false;
+        node.parent.right = temp;
+      }
+      temp.left = node;
+      temp.isLeftChild = true;
+      node.parent = temp;
+    }
+  }
+
+  rightRotate(node) {
+    const temp = node.left;
+    node.left = temp.right;
+    if (node.left != null) {
+      node.left.parent = node;
+      node.left.isLeftChild = true;
+    }
+    if (node.parent == null) {
+      this.root = temp;
+      temp.parent = null;
+    }
+    if (node.isLeftChild) {
+      temp.isLeftChild = true;
+      node.parent.left = temp;
+    } else {
+      temp.isLeftChild = false;
+      node.parent.right = temp;
+    }
+    temp.right = node;
+    node.isLeftChild = false;
+    node.parent = temp;
+  }
+
+  leftRightRotate(node) {
+    this.leftRotate(node.left);
+    this.rightRotate(node);
+  }
+
+  rightLeftRotate(node) {
+    this.rightRotate(node.right);
+    this.leftRotate(node);
+  }
+
+  isKeyGreater(newNode, parent) {
+    return newNode.key > parent.key;
+  }
+
+  ascendingOrder() {
+    this.inOrderTraversal(this.root);
+  }
+
+  inOrderTraversal(node) {
+    if (node == null) {
+      return;
+    }
+    this.inOrderTraversal(node.left);
+    console.log(node.key);
+    this.inOrderTraversal(node.right);
+  }
+}
+
+const tree = new RedBlackTree();
+tree.add("apil", 10);
+tree.add("bily", 5);
+tree.add("anup", 1);
+tree.add("kshitiz", 40);
+tree.add("aang", 2);
+tree.add("zing", 6);
+tree.add("zong", 23);
+tree.ascendingOrder();

From af6e1393573f03049990460e39812216b9965f9b Mon Sep 17 00:00:00 2001
From: apil <078bct017.apil@pcampus.edu.np>
Date: Fri, 8 Mar 2024 01:54:27 +0545
Subject: [PATCH 05/10] working red-black tree

---
 src/algorithms/red_black_tree.js | 19 +++++++++++++++++--
 1 file changed, 17 insertions(+), 2 deletions(-)

diff --git a/src/algorithms/red_black_tree.js b/src/algorithms/red_black_tree.js
index 2ebce64..2b3e4ad 100644
--- a/src/algorithms/red_black_tree.js
+++ b/src/algorithms/red_black_tree.js
@@ -31,7 +31,7 @@ class RedBlackTree {
   }
 
   insert(parent, newNode) {
-    if (this.isKeyGreater(newNode, parent)) {
+    if (this.isNewnodeKeyGreater(newNode, parent)) {
       if (parent.right == null) {
         parent.right = newNode;
         newNode.parent = parent;
@@ -55,6 +55,7 @@ class RedBlackTree {
   //checks for if two consecutive trees are red
   checkColor(node) {
     if (node == this.root) {
+      node.black = true;
       return;
     }
     if (!node.black && !node.parent.black) {
@@ -192,13 +193,16 @@ class RedBlackTree {
     this.leftRotate(node);
   }
 
-  isKeyGreater(newNode, parent) {
+  isNewnodeKeyGreater(newNode, parent) {
     return newNode.key > parent.key;
   }
 
   ascendingOrder() {
     this.inOrderTraversal(this.root);
   }
+  descendingOrder() {
+    this.reverseOrderTraversal(this.root);
+  }
 
   inOrderTraversal(node) {
     if (node == null) {
@@ -208,6 +212,15 @@ class RedBlackTree {
     console.log(node.key);
     this.inOrderTraversal(node.right);
   }
+
+  reverseOrderTraversal(node) {
+    if (node == null) {
+      return;
+    }
+    this.reverseOrderTraversal(node.right);
+    console.log(node.key);
+    this.reverseOrderTraversal(node.left);
+  }
 }
 
 const tree = new RedBlackTree();
@@ -219,3 +232,5 @@ tree.add("aang", 2);
 tree.add("zing", 6);
 tree.add("zong", 23);
 tree.ascendingOrder();
+console.log(" ");
+tree.descendingOrder();

From c457d9841e4f43a5fa12fdbfe2040e8605bf7de1 Mon Sep 17 00:00:00 2001
From: apil <078bct017.apil@pcampus.edu.np>
Date: Fri, 8 Mar 2024 22:25:03 +0545
Subject: [PATCH 06/10] redblack-tree export added

---
 src/algorithms/red_black_tree.js | 26 +++++++++++++++-----------
 1 file changed, 15 insertions(+), 11 deletions(-)

diff --git a/src/algorithms/red_black_tree.js b/src/algorithms/red_black_tree.js
index 2b3e4ad..997503d 100644
--- a/src/algorithms/red_black_tree.js
+++ b/src/algorithms/red_black_tree.js
@@ -223,14 +223,18 @@ class RedBlackTree {
   }
 }
 
-const tree = new RedBlackTree();
-tree.add("apil", 10);
-tree.add("bily", 5);
-tree.add("anup", 1);
-tree.add("kshitiz", 40);
-tree.add("aang", 2);
-tree.add("zing", 6);
-tree.add("zong", 23);
-tree.ascendingOrder();
-console.log(" ");
-tree.descendingOrder();
+export default RedBlackTree;
+
+//Implementation example
+
+// const tree = new RedBlackTree();
+// tree.add("apil", 10);
+// tree.add("bily", 5);
+// tree.add("anup", 1);
+// tree.add("kshitiz", 40);
+// tree.add("aang", 2);
+// tree.add("zing", 6);
+// tree.add("zong", 23);
+// tree.ascendingOrder();
+// console.log(" ");
+// tree.descendingOrder();

From 3e53e510c4fc06527f05e56c69ed713e6f5bcd88 Mon Sep 17 00:00:00 2001
From: Anoobee <aryalanup13@gmail.com>
Date: Sat, 9 Mar 2024 01:13:28 +0545
Subject: [PATCH 07/10]  integrated DLL

---
 src/App.jsx             |  15 ++++--
 src/Player/AudioData.js |  50 ++++++++++++------
 src/Player/Player.jsx   | 109 ++++++++++++++++++++--------------------
 src/algorithms/dll.js   |  31 +++++++-----
 4 files changed, 116 insertions(+), 89 deletions(-)

diff --git a/src/App.jsx b/src/App.jsx
index 48c315e..881ac67 100644
--- a/src/App.jsx
+++ b/src/App.jsx
@@ -1,16 +1,17 @@
 import Player from "./Player/Player";
 import "./Player/player.scss";
-import { songsdata } from "./Player/AudioData.js";
 import { useRef, useState, useEffect } from "react";
+import { song_dll } from "./Player/AudioData.js";
+import { BsArrowsExpandVertical } from "react-icons/bs";
 
 const App = () => {
-  const [songs, setSongs] = useState(songsdata);
+  const [songs, setSongs] = useState(song_dll);
   const [isplaying, setisplaying] = useState(false);
-  const [currentSong, setCurrentSong] = useState(songsdata[1]);
+  const [currentSong, setCurrentSong] = useState(window.current_song_ptr);
 
   const audioElem = useRef();
 
-  useEffect(() => {
+  useEffect(() => {songs
     if (isplaying) {
       audioElem.current.play();
     } else {
@@ -31,7 +32,11 @@ const App = () => {
 
   return (
     <div className="center-content">
-      <audio src={currentSong.url} ref={audioElem} onTimeUpdate={onPlaying} />
+      <audio
+        src={currentSong.data.url}
+        ref={audioElem}
+        onTimeUpdate={onPlaying}
+      />
       <Player
         songs={songs}
         setSongs={setSongs}
diff --git a/src/Player/AudioData.js b/src/Player/AudioData.js
index e7301a3..c9246b2 100644
--- a/src/Player/AudioData.js
+++ b/src/Player/AudioData.js
@@ -1,22 +1,40 @@
+import DoublyLinkedList from "../algorithms/dll";
 import song1 from "../assets/music/02. Paul Flint - Savage.mp3";
 import song3 from "../assets/music/03. Retrovision - Puzzle.mp3";
 import song2 from "../assets/music/04. Syn Cole - Feel Good.mp3";
 
-const songsdata = [
-    {
-        "title": "Paul Flint - Savage",
-        "url": song1
-    },
-    {
-        "title": "Retrovision - Puzzle",
-        "url": song2
-    },
-    {
-        "title": "Syn Cole - Feel Good",
-        "url": song3
-    }
-]
-export { songsdata }; // change hello 
+
+
+class song_node {
+  constructor() {
+    this.title = null;
+    this.url = null;
+  }
+}
+
+const s1 = new song_node();
+const s3 = new song_node();
+const s2 = new song_node();
+
+s1.title = "Paul Flint - Savage";
+s1.url = song1;
+
+s2.title = "Syn Cole - Feel Good";
+s2.url = song2;
+
+s3.title = "Retrovision - Puzzle";
+s3.url = song3;
+
+const song_dll = new DoublyLinkedList();
+song_dll.pushBack(s1);
+song_dll.pushBack(s2);
+song_dll.pushBack(s3);
+
+
+
+window.current_song_ptr = song_dll.head;
+export {  song_dll, song_node };
+
 
 //Better Data
 // let savage = {
@@ -283,4 +301,4 @@ export { songsdata }; // change hello
 //     audio: null,
 //     isFav: null,
 //     duration: 161,
-//   };
\ No newline at end of file
+//   };
diff --git a/src/Player/Player.jsx b/src/Player/Player.jsx
index fa12ec7..a96e7ab 100644
--- a/src/Player/Player.jsx
+++ b/src/Player/Player.jsx
@@ -1,85 +1,85 @@
-import  { useRef } from 'react';
-import './player.scss';
-import {BsFillPlayCircleFill, BsFillPauseCircleFill, BsFillSkipStartCircleFill, BsFillSkipEndCircleFill} from 'react-icons/bs';
-
-const Player = ({audioElem, isPlaying, setIsPlaying, currentSong, setCurrentSong, songs})=> {
-
+import { useRef } from "react";
+import "./player.scss";
+import {
+  BsFillPlayCircleFill,
+  BsFillPauseCircleFill,
+  BsFillSkipStartCircleFill,
+  BsFillSkipEndCircleFill,
+} from "react-icons/bs";
+const Player = ({
+  audioElem,
+  isPlaying,
+  setIsPlaying,
+  currentSong,
+  setCurrentSong,
+ 
+}) => {
   const clickRef = useRef();
 
-  const PlayPause = ()=>
-  {
+  const PlayPause = () => {
     setIsPlaying(!isPlaying);
+  };
 
-  }
-
-
-  const checkWidth = (e)=>
-  {
+  const checkWidth = (e) => {
     let width = clickRef.current.clientWidth;
     const offset = e.nativeEvent.offsetX;
 
-    const divprogress = offset / width * 100;
-    audioElem.current.currentTime = divprogress / 100 * currentSong.length;
+    const divprogress = (offset / width) * 100;
+    audioElem.current.currentTime = (divprogress / 100) * currentSong.length;
+  };
 
-  }
+  const skipBack = () => {
 
-  const skipBack = ()=>
-  {
-    const index = songs.findIndex(x=>x.title == currentSong.title);
-    if (index == 0)
-    {
-      setCurrentSong(songs[songs.length - 1])
-    }
-    else
-    {
-      setCurrentSong(songs[index - 1])
+    if (window.current_song_ptr.prev !== null) {
+      window.current_song_ptr = window.current_song_ptr.prev;
+      setCurrentSong(window.current_song_ptr);
     }
-    audioElem.current.currentTime = 0;
-    
-  }
 
 
-  const skiptoNext = ()=>
-  {
-    const index = songs.findIndex(x=>x.title == currentSong.title);
+    audioElem.current.currentTime = 0;
+  };
 
-    if (index == songs.length-1)
-    {
-      setCurrentSong(songs[0])
-    }
-    else
-    {
-      setCurrentSong(songs[index + 1])
+  const skiptoNext = () => {
+    if (window.current_song_ptr.next !== null) {
+      window.current_song_ptr = window.current_song_ptr.next;
+      setCurrentSong(window.current_song_ptr);
     }
+
     audioElem.current.currentTime = 0;
-    
-  }
+  };
 
   return (
-    <div className='player_container'>
+    <div className="player_container">
       <div className="title">
         <p>{currentSong.title}</p>
       </div>
       <div className="navigation">
         <div className="navigation_wrapper" onClick={checkWidth} ref={clickRef}>
-          <div className="seek_bar" style={{width: `${currentSong.progress+"%"}`}}></div>
+          <div
+            className="seek_bar"
+            style={{ width: `${currentSong.progress + "%"}` }}
+          ></div>
         </div>
       </div>
       <div className="controls">
-        <BsFillSkipStartCircleFill className='btn_action' onClick={skipBack}/>
-        {isPlaying ? <BsFillPauseCircleFill className='btn_action pp' onClick={PlayPause}/> : <BsFillPlayCircleFill className='btn_action pp' onClick={PlayPause}/>}
-        <BsFillSkipEndCircleFill className='btn_action' onClick={skiptoNext}/>        
+        <BsFillSkipStartCircleFill className="btn_action" onClick={skipBack} />
+        {isPlaying ? (
+          <BsFillPauseCircleFill
+            className="btn_action pp"
+            onClick={PlayPause}
+          />
+        ) : (
+          <BsFillPlayCircleFill className="btn_action pp" onClick={PlayPause} />
+        )}
+        <BsFillSkipEndCircleFill className="btn_action" onClick={skiptoNext} />
       </div>
     </div>
-  
-  )
-}
-
-export default Player
-
-import PropTypes from 'prop-types';
+  );
+};
 
+export default Player;
 
+import PropTypes from "prop-types";
 
 Player.propTypes = {
   audioElem: PropTypes.object, // or other appropriate PropType
@@ -87,5 +87,4 @@ Player.propTypes = {
   setIsPlaying: PropTypes.func,
   currentSong: PropTypes.object,
   setCurrentSong: PropTypes.func,
-  songs: PropTypes.array
-};
\ No newline at end of file
+};
diff --git a/src/algorithms/dll.js b/src/algorithms/dll.js
index 1f50184..9a71ebc 100644
--- a/src/algorithms/dll.js
+++ b/src/algorithms/dll.js
@@ -37,8 +37,8 @@ class DoublyLinkedList {
       this.head = newNode;
       this.tail = newNode;
     } else {
-      newNode.prev = this.tail;
       this.tail.next = newNode;
+      newNode.prev = this.tail;
       this.tail = newNode;
     }
     this.size++;
@@ -89,7 +89,7 @@ class DoublyLinkedList {
     return removedData;
   }
 
-  display() {
+ display() {
     let current = this.head;
     while (current) {
       console.log(current.data);
@@ -99,15 +99,20 @@ class DoublyLinkedList {
 }
 
 export default DoublyLinkedList;
-// // Example usage:
-// const dll = new DoublyLinkedList();
-// dll.pushBack(1);
-// dll.pushBack("anup");
-// dll.pushBack(3);
+// Example usage:
+const dll = new DoublyLinkedList();
+dll.pushBack(1);
+dll.pushBack("anup");
+dll.pushBack(3);
 // dll.display(); // Output: 1 anup 3
-// console.log("Front:", dll.front()); // Output: Front: 1
-// console.log("Back:", dll.back()); // Output: Back: 3
-// dll.popBack();
-// dll.display(); // Output: 1 anup
-// dll.popFront();
-// dll.display(); // Output: anup
+var ptr = dll.head;
+ptr= ptr.next;
+ptr = ptr.prev;
+console.log(ptr.data);
+
+// console.log(dll.tail.prev.prev.data);
+
+
+
+
+

From 23ae8e18cf84b72625687e1e6edf98722a0a6a0e Mon Sep 17 00:00:00 2001
From: apil <078bct017.apil@pcampus.edu.np>
Date: Sat, 9 Mar 2024 07:35:06 +0545
Subject: [PATCH 08/10] sorting - not tested

---
 src/App.jsx                      | 15 ++++++++
 src/Player/AudioData.js          | 60 ++++++++++++++++++++++----------
 src/algorithms/red_black_tree.js | 34 ++++++++++--------
 3 files changed, 76 insertions(+), 33 deletions(-)

diff --git a/src/App.jsx b/src/App.jsx
index 313d633..6dbe9e8 100644
--- a/src/App.jsx
+++ b/src/App.jsx
@@ -2,8 +2,16 @@ import Player from "./Player/Player";
 import "./Player/player.scss";
 import { songsdata } from "./Player/AudioData.js";
 import { useRef, useState, useEffect } from "react";
+import RedBlackTree from "./algorithms/red_black_tree.js";
 
 const App = () => {
+  //Inserting songsdata into redblack tree
+  const songsTree = new RedBlackTree();
+
+  songsdata.forEach((item) => {
+    songsTree.add(item.title, item.url);
+  });
+
   const [songs, setSongs] = useState(songsdata);
   const [isplaying, setisplaying] = useState(false);
   const [currentSong, setCurrentSong] = useState(songsdata[1]);
@@ -29,6 +37,13 @@ const App = () => {
     });
   };
 
+  //Returns new sorted list of songs object
+  const sortByTitle = (rb_tree) => {
+    const emptyList = [];
+    const sortedList = rb_tree.inOrderTraversal(rb_tree.root, emptyList);
+    return sortedList;
+  };
+
   return (
     <div className="center-content">
       <audio src={currentSong.url} ref={audioElem} onTimeUpdate={onPlaying} />
diff --git a/src/Player/AudioData.js b/src/Player/AudioData.js
index 07530d6..78cd84e 100644
--- a/src/Player/AudioData.js
+++ b/src/Player/AudioData.js
@@ -1,22 +1,46 @@
-import song1 from "../assets/music/02. Paul Flint - Savage.mp3";
-import song3 from "../assets/music/03. Retrovision - Puzzle.mp3";
-import song2 from "../assets/music/04. Syn Cole - Feel Good.mp3";
+// import song1 from "../assets/music/02. Paul Flint - Savage.mp3";
+// import song3 from "../assets/music/03. Retrovision - Puzzle.mp3";
+// import song2 from "../assets/music/04. Syn Cole - Feel Good.mp3";
 
-const songsdata = [
-    {
-        "title": "Paul Flint - Savage",
-        "url": song1
-    },
-    {
-        "title": "Retrovision - Puzzle",
-        "url": song2
-    },
-    {
-        "title": "Syn Cole - Feel Good",
-        "url": song3
+import fs from "fs";
+
+const directoryPath = "../assets/music";
+
+// Read the contents of the directory
+const readDirectory = async (directoryPath) => {
+  const file_array = await fs.readdir(directoryPath, (err, files) => {
+    const array = [];
+    if (err) {
+      console.error("Error reading directory:", err);
+      return;
     }
-]
-export { songsdata };
+
+    files.forEach((file) => {
+      array.push(file);
+    });
+    return array;
+  });
+  return file_array;
+};
+
+const data = setTimeout(() => readDirectory(directoryPath), 50);
+console.log(data);
+
+// const songsdata = [
+//   {
+//     title: "Paul Flint - Savage",
+//     url: song1,
+//   },
+//   {
+//     title: "Retrovision - Puzzle",
+//     url: song2,
+//   },
+//   {
+//     title: "Syn Cole - Feel Good",
+//     url: song3,
+//   },
+// ];
+// export { songsdata };
 
 //Better Data
 // let savage = {
@@ -283,4 +307,4 @@ export { songsdata };
 //     audio: null,
 //     isFav: null,
 //     duration: 161,
-//   };
\ No newline at end of file
+//   };
diff --git a/src/algorithms/red_black_tree.js b/src/algorithms/red_black_tree.js
index 997503d..beae87c 100644
--- a/src/algorithms/red_black_tree.js
+++ b/src/algorithms/red_black_tree.js
@@ -197,29 +197,33 @@ class RedBlackTree {
     return newNode.key > parent.key;
   }
 
-  ascendingOrder() {
-    this.inOrderTraversal(this.root);
-  }
-  descendingOrder() {
-    this.reverseOrderTraversal(this.root);
-  }
-
-  inOrderTraversal(node) {
+  // ascendingOrder() {
+  //   const sortedList = this.inOrderTraversal(this.root);
+  //   return sortedList;
+  // }
+  // descendingOrder() {
+  //   const sortedList = this.reverseOrderTraversal(this.root);
+  //   return sortedList;
+  // }
+
+  inOrderTraversal(node, sortedArray = []) {
     if (node == null) {
       return;
     }
-    this.inOrderTraversal(node.left);
-    console.log(node.key);
-    this.inOrderTraversal(node.right);
+    this.inOrderTraversal(node.left, sortedArray);
+    sortedArray.push(node);
+    this.inOrderTraversal(node.right, sortedArray);
+    return sortedArray;
   }
 
-  reverseOrderTraversal(node) {
+  reverseOrderTraversal(node, sortedArray = []) {
     if (node == null) {
       return;
     }
-    this.reverseOrderTraversal(node.right);
-    console.log(node.key);
-    this.reverseOrderTraversal(node.left);
+    this.reverseOrderTraversal(node.right, sortedArray);
+    sortedArray.push(node);
+    this.reverseOrderTraversal(node.left, sortedArray);
+    return sortedArray;
   }
 }
 

From 3593ad91145d604546c0f86e263421781823fa25 Mon Sep 17 00:00:00 2001
From: apil <078bct017.apil@pcampus.edu.np>
Date: Sat, 9 Mar 2024 23:59:30 +0545
Subject: [PATCH 09/10] handled edge-cases in checkcolor() method and fixed
 left and right rotate methods

---
 src/algorithms/red_black_tree.js | 47 +++++++++++++++-----------------
 1 file changed, 22 insertions(+), 25 deletions(-)

diff --git a/src/algorithms/red_black_tree.js b/src/algorithms/red_black_tree.js
index beae87c..c6a466f 100644
--- a/src/algorithms/red_black_tree.js
+++ b/src/algorithms/red_black_tree.js
@@ -58,10 +58,14 @@ class RedBlackTree {
       node.black = true;
       return;
     }
-    if (!node.black && !node.parent.black) {
-      this.correctTree(node);
+    if (!node) {
+      if (!node.parent) {
+        if (!node.black && !node.parent.black) {
+          this.correctTree(node);
+        }
+        this.checkColor(node.parent);
+      }
     }
-    this.checkColor(node.parent);
   }
 
   //corrects tree
@@ -154,10 +158,10 @@ class RedBlackTree {
         temp.isLeftChild = false;
         node.parent.right = temp;
       }
-      temp.left = node;
-      temp.isLeftChild = true;
-      node.parent = temp;
     }
+    temp.left = node;
+    temp.isLeftChild = true;
+    node.parent = temp;
   }
 
   rightRotate(node) {
@@ -170,13 +174,15 @@ class RedBlackTree {
     if (node.parent == null) {
       this.root = temp;
       temp.parent = null;
-    }
-    if (node.isLeftChild) {
-      temp.isLeftChild = true;
-      node.parent.left = temp;
     } else {
-      temp.isLeftChild = false;
-      node.parent.right = temp;
+      temp.parent = node.parent;
+      if (node.isLeftChild) {
+        temp.isLeftChild = true;
+        node.parent.left = temp;
+      } else {
+        temp.isLeftChild = false;
+        node.parent.right = temp;
+      }
     }
     temp.right = node;
     node.isLeftChild = false;
@@ -197,21 +203,12 @@ class RedBlackTree {
     return newNode.key > parent.key;
   }
 
-  // ascendingOrder() {
-  //   const sortedList = this.inOrderTraversal(this.root);
-  //   return sortedList;
-  // }
-  // descendingOrder() {
-  //   const sortedList = this.reverseOrderTraversal(this.root);
-  //   return sortedList;
-  // }
-
   inOrderTraversal(node, sortedArray = []) {
     if (node == null) {
       return;
     }
     this.inOrderTraversal(node.left, sortedArray);
-    sortedArray.push(node);
+    sortedArray.push(node.value);
     this.inOrderTraversal(node.right, sortedArray);
     return sortedArray;
   }
@@ -220,9 +217,9 @@ class RedBlackTree {
     if (node == null) {
       return;
     }
-    this.reverseOrderTraversal(node.right, sortedArray);
-    sortedArray.push(node);
-    this.reverseOrderTraversal(node.left, sortedArray);
+    this.inOrderTraversal(node.right, sortedArray);
+    sortedArray.push(node.value);
+    this.inOrderTraversal(node.left, sortedArray);
     return sortedArray;
   }
 }

From 0e31bc7bed7e5256f647d2aebf5572445bd843e5 Mon Sep 17 00:00:00 2001
From: apil <078bct017.apil@pcampus.edu.np>
Date: Sun, 10 Mar 2024 00:00:59 +0545
Subject: [PATCH 10/10] exported songTree and sortedList

---
 src/Player/AudioData.js | 52 +++++++++++++++++++++++++----------------
 1 file changed, 32 insertions(+), 20 deletions(-)

diff --git a/src/Player/AudioData.js b/src/Player/AudioData.js
index 98ad20f..d2163b1 100644
--- a/src/Player/AudioData.js
+++ b/src/Player/AudioData.js
@@ -4,29 +4,29 @@
 // import song3 from "../assets/music/03. Retrovision - Puzzle.mp3";
 // import song2 from "../assets/music/04. Syn Cole - Feel Good.mp3";
 
-import fs from "fs";
+// import fs from "fs";
 
-const directoryPath = "../assets/music";
+// const directoryPath = "../assets/music";
 
-// Read the contents of the directory
-const readDirectory = async (directoryPath) => {
-  const file_array = await fs.readdir(directoryPath, (err, files) => {
-    const array = [];
-    if (err) {
-      console.error("Error reading directory:", err);
-      return;
-    }
+// // Read the contents of the directory
+// const readDirectory = async (directoryPath) => {
+//   const file_array = await fs.readdir(directoryPath, (err, files) => {
+//     const array = [];
+//     if (err) {
+//       console.error("Error reading directory:", err);
+//       return;
+//     }
 
-    files.forEach((file) => {
-      array.push(file);
-    });
-    return array;
-  });
-  return file_array;
-};
+//     files.forEach((file) => {
+//       array.push(file);
+//     });
+//     return array;
+//   });
+//   return file_array;
+// };
 
-const data = setTimeout(() => readDirectory(directoryPath), 50);
-console.log(data);
+// const data = setTimeout(() => readDirectory(directoryPath), 50);
+// console.log(data);
 
 // const songsdata = [
 //   {
@@ -50,6 +50,8 @@ import DoublyLinkedList from "../algorithms/dll";
 import song1 from "../assets/music/02. Paul Flint - Savage.mp3";
 import song3 from "../assets/music/03. Retrovision - Puzzle.mp3";
 import song2 from "../assets/music/04. Syn Cole - Feel Good.mp3";
+import RedBlackTree from "../algorithms/red_black_tree";
+// import { cursorTo } from "readline";
 
 class song_node {
   constructor() {
@@ -76,8 +78,18 @@ song_dll.pushBack(s1);
 song_dll.pushBack(s2);
 song_dll.pushBack(s3);
 
+const songTree = new RedBlackTree();
+let cur_ptr = song_dll.head;
+while (cur_ptr != null) {
+  songTree.add(cur_ptr.data.title, cur_ptr.data);
+  cur_ptr = cur_ptr.next;
+}
+
+const sortedList = songTree.inOrderTraversal(songTree.root);
+console.log(sortedList);
+
 window.current_song_ptr = song_dll.head;
-export { song_dll, song_node };
+export { song_dll, songTree, sortedList, song_node };
 
 //Better Data
 // let savage = {