It’s about Bitree. It should output Postorder traversal after input Preorder traversal and Inorder traversal. #include <stdio.h> #include <string.h> void traverBitree(char *first, char *middle); int index = 0; int main(void) { char first[27], middle[27]; gets(first); gets(middle); traverBitree(first, middle); } void traverBitree(char *first, char *middle) { if (strlen(middle) == 0) return; char ch = first[index++]; int… Read More Why does it say I don't declare a varibale but actually I declared?

Attempting to reduce a flat list of items (each with a list of their own statuses) into a tree, where the status of the child node influences the parent. const Status = { UNKNOWN : { name: ‘UNKNOWN’ , priority: 0 }, DEBUG : { name: ‘DEBUG’ , priority: 1 }, INFO : { name:… Read More Reduce a tree by recursively rolling up the parent's child nodes

I am trying to figure out how to traverse through a 2D array. The way in which I have been doing it is by using a nested for loop. I am curious to know of any other ways in which this can be done. I just feel like I am repeatedly using nested for loops… Read More Traversing through a 2D array

It’s easy to get a specific variable object from a JSON array in Jinja like: array[‘somekey’] but what if i want to access a value deeper in the nested list like: array[‘somekey.subkey’] These dots inside the square brackets don’t work so i can’t access a value at a variable position? Imagine a simple array of… Read More Use of dots inside brackets to reach variable depth JSON in Jinja2 like ['object.subobject']?

As aforementioned in Question title, I have a Batch/CMD(OS: Windows 10 64Bit) script to traverse the subfolders inside %LocalAppData% if the passed argument to script is Chrome, and recursively find and list out all folders containing word Cache at any position. The script I have come up with relying on for /d /r loop is… Read More For /d /r loop not traversing sub-directories for finding desired directory recursively in Batch/CMD script

public List<String> findItinerary(List<List<String>> tickets) { // creating adjencency list for(String[] ticket : tickets) { map.putIfAbsent( ticket[0] ,new PriorityQueue<String>()); map.get(ticket[0]).add(ticket[1]); } dfs("JKF"); return path; } I m trying to create the adjacency list here, but having problem to iterate through list inside the tickets. I was using for each loop , and coming across this error… Read More How should i traverse inside two dimensional array list using for each loop

I’m just starting to learn Algorithms and Data Structures in Python and I’ve come across this linked list problem. Overall I’ve managed to find the middle node the naive way but I don’t understand why after the list is traversed it doesn’t output the last print command. This is the traverse function: def traverse(self): actual_node… Read More Problem in traversing a linked list after finding the middle node