Given an array of elements, return the root node of a tree containing in the elements [closed]

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP





.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0;







up vote
0
down vote

favorite












I was trying to solve the following problem recently online.
My question has to do various ways of solving this problem. I know I can just use breadth-first search traversal to solve the problem, but wondering if there's any other way to do this.




Given an array of elements, return the root node of a tree containing
the elements of the array progressing top down, left to right. ex:

input: [a,b,c,d,e,f,g] result tree:




 a
 / 
 b c
 / / 
 d e f g



here's my implementation of this problem for printing out in
breadth-first search order.




function graphBFS(graph, start) 
 const queue = new Queue();
 const visited = new Set([start]);
 queue.enqueue(start);
 while (queue.length) 
 const neighbors = graph.neighbors(queue.dequeue());
 for (const neighbor of neighbors) 
 if (!visited.has(neighbor)) 
 queue.enqueue(neighbor);
 visited.add(neighbor);



thanks for your feedback and help.




tree




share|improve this question











closed as unclear what you're asking by 200_success, Stephen Rauch, Heslacher, yuri, Ludisposed Jul 31 at 7:51


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.










  • 1




    Which language? JavaScript?
    – Zeta
    Jul 30 at 17:10
















up vote
0
down vote

favorite












I was trying to solve the following problem recently online.
My question has to do various ways of solving this problem. I know I can just use breadth-first search traversal to solve the problem, but wondering if there's any other way to do this.




Given an array of elements, return the root node of a tree containing
the elements of the array progressing top down, left to right. ex:

input: [a,b,c,d,e,f,g] result tree:




 a
 / 
 b c
 / / 
 d e f g



here's my implementation of this problem for printing out in
breadth-first search order.




function graphBFS(graph, start) 
 const queue = new Queue();
 const visited = new Set([start]);
 queue.enqueue(start);
 while (queue.length) 
 const neighbors = graph.neighbors(queue.dequeue());
 for (const neighbor of neighbors) 
 if (!visited.has(neighbor)) 
 queue.enqueue(neighbor);
 visited.add(neighbor);



thanks for your feedback and help.




tree




share|improve this question











closed as unclear what you're asking by 200_success, Stephen Rauch, Heslacher, yuri, Ludisposed Jul 31 at 7:51


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.










  • 1




    Which language? JavaScript?
    – Zeta
    Jul 30 at 17:10












up vote
0
down vote

favorite









up vote
0
down vote

favorite











I was trying to solve the following problem recently online.
My question has to do various ways of solving this problem. I know I can just use breadth-first search traversal to solve the problem, but wondering if there's any other way to do this.




Given an array of elements, return the root node of a tree containing
the elements of the array progressing top down, left to right. ex:

input: [a,b,c,d,e,f,g] result tree:




 a
 / 
 b c
 / / 
 d e f g



here's my implementation of this problem for printing out in
breadth-first search order.




function graphBFS(graph, start) 
 const queue = new Queue();
 const visited = new Set([start]);
 queue.enqueue(start);
 while (queue.length) 
 const neighbors = graph.neighbors(queue.dequeue());
 for (const neighbor of neighbors) 
 if (!visited.has(neighbor)) 
 queue.enqueue(neighbor);
 visited.add(neighbor);



thanks for your feedback and help.




tree




share|improve this question











I was trying to solve the following problem recently online.
My question has to do various ways of solving this problem. I know I can just use breadth-first search traversal to solve the problem, but wondering if there's any other way to do this.




Given an array of elements, return the root node of a tree containing
the elements of the array progressing top down, left to right. ex:

input: [a,b,c,d,e,f,g] result tree:




 a
 / 
 b c
 / / 
 d e f g



here's my implementation of this problem for printing out in
breadth-first search order.




function graphBFS(graph, start) 
 const queue = new Queue();
 const visited = new Set([start]);
 queue.enqueue(start);
 while (queue.length) 
 const neighbors = graph.neighbors(queue.dequeue());
 for (const neighbor of neighbors) 
 if (!visited.has(neighbor)) 
 queue.enqueue(neighbor);
 visited.add(neighbor);



thanks for your feedback and help.





tree





share|improve this question










share|improve this question




share|improve this question









asked Jul 30 at 16:45









NinjaG

634221




634221




closed as unclear what you're asking by 200_success, Stephen Rauch, Heslacher, yuri, Ludisposed Jul 31 at 7:51


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.






closed as unclear what you're asking by 200_success, Stephen Rauch, Heslacher, yuri, Ludisposed Jul 31 at 7:51


Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.









  • 1




    Which language? JavaScript?
    – Zeta
    Jul 30 at 17:10












  • 1




    Which language? JavaScript?
    – Zeta
    Jul 30 at 17:10







1




1




Which language? JavaScript?
– Zeta
Jul 30 at 17:10




Which language? JavaScript?
– Zeta
Jul 30 at 17:10















active

oldest

votes






















active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
-

Popular posts from this blog

Greedy Best First Search implementation in Rust

Image
Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 1 down vote favorite I have implemented a Greedy Best First Search algorithm in Rust, since I couldn't find an already implemented one in the existing crates. I have a small pet project I do in Rust, and the Greedy BFS is at the core of it. The algorithm is designed to be as flexible as possible. Theoretically, this algorithm could be used as a greedy depth-first search or as a greedy a*. I want to design a good algorithm that I could later use in any other project needing it, not only this one. I am quite new to Rust and this is the second project I do in this language. Also, I am new to writing optimized algorithms. Since this search will be called often, my main concern is performance. What are some tips and tricks to make the algorithm perform better? Of course any other critique and comment is welcome. Bellow is the code: //! Here is
Read more

Function to Return a JSON Like Objects Using VBA Collections and Arrays

Image
Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 1 down vote favorite My goal is to create a compact function that can create a JSON Like object from JSON string. I want a function with a small footprint that I or anyone who wants to use it, can simply paste into a module and use. At 61 lines of code, I am happy with its size and portability. Here is an image of JSON Object created from string data using a ScriptControl . Although the Locals Window displays the properties and values correctly, the object itself is extremely difficult to work with. This image shows an object created using getJSONCollection . Because it is made of VBA Collections and Arrays, it is very easy to work with. Option Explicit Private Function getJSONCollection(ByVal Value As Variant, Optional ScriptEngine As Object) As Variant Const DELIMITER As String = "||" Dim col As Collection, JSON As Object, KeyNam
Read more

C++11 CLH Lock Implementation

Image
Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 1 down vote favorite 1 As a hobbyist programmer I have been reading "The Art of Multiprocessor Programming" (Herlihy, Maurice; Shavit, Nir) and converting the Java spin locks into C++ - I have enjoyed this and learned a lot. I have implemented the CLH spin queue lock (due to Travis Craig, Erik Hagersten, and Anders Landin) but I feel unhappy about the way that I have the raw pointers interacting with smart pointers and would be grateful for code review advice. As I understand it I must use a smart pointer, in this case std::unique_ptr , for my thread local node pointer or the lock will not deallocate properly and the clh_lock will leak. But... I also have no choice but to use a raw atomic tail queue pointer in order access the atomic exchange member function. Therefore, I have to come up with some combination of either, raw or smart
Read more