I'm currently working through a problem that I'm having some trouble figuring out where I need to find a child node in an array of objects. The target could be one or many levels deep. The issue is, once I find the object, I also need to pus...

I tried the algorith below to DFS the DOM tree but it doesn't work! It can just check the first path in the DOM tree. WHY?! function DFS(P) // (ScanRegion, Elem, MCF) { P.Elem.setAttribute("Checked", "1"); Children = P.E...

Given is this tree data structure: const tree = {v:"f", c:[ {v:"b", c:[ {v:"a", c:[]}, {v:"d", c:[ {v:"c", c:[]}, {v:"e", c:[]} ]} ]}, {v:"g", c:[ {v:"i...

I'm trying to do a depth first search through a complex JSON object such as this one, and output a new object with a new structure of: [ { name: "Blade Runner", children : [ {Obj}, {Obj},{Obj}, ... ]...

I've an object collection like this: [ {key:8, parent:'none'}, {key:5, parent:8}, {key:3, parent:5}, {key:2, parent:3}, {key:4, parent:5}, {key:1, parent:4}, {key:3, parent:4}, {key:2, parent:3}, ] all possible paths: 8->5-...

Currently learning about DFS and just have a few questions about the mechanics of how it works. Repl link below due to the lengthy nature of the code: https://repl.it/@Stylebender/DFS-Recursive Is the base case of the traverseInOrder function jus...

Can someone please explain how does DFS work on nested arrays. I'm referring to all wiki and stackover sources, but I dont quite understand how to do a recursive search on a an arry using DFS, consider this as my array: array = ["abc",&#...

I have implemented a dfs search for an 8 puzzle game but for some reason I can't manage to get it work as it should, my stack keeps adding and adding possible movements for my 8 puzzle game but it never decreases for an answer, I don't know i...

I need to check if two given binary trees are the same. Here's an iterative solution that I wrote: /** * Definition for a binary tree node. * function TreeNode(val) { * this.val = val; * this.left = this.right = null; * } */ /** *...

©2020 All rights reserved.