Questions tagged [tree]
A tree is a graph in which there is exactly one path between any two nodes. It is often used as a hierarchical data structure.
889
questions
4
votes
1
answer
220
views
Maximum profit earned on weighted un-directed tree
I came across this problem while giving a sample test.
The problem was that we have given a tree which is undirected. We can
start from any node of our choice. Initially we have power "P" and
...
- 143
6
votes
2
answers
2k
views
Javascript - Find a deepest node in a binary tree
Problem Statement
Given the root of a binary tree, return a deepest node.
For example, in the following tree, return d.
a
/ \
b c
/
d
My ...
- 1,565
3
votes
1
answer
112
views
Generic Fenwick Tree
A Fenwick Tree, or a Binary Indexed tree, is an interesting data structure that can efficiently update its elements. You can read more about it in this paper.
Here is a generic implementation of a ...
- 867
2
votes
1
answer
1k
views
Simple dynamic tree in Python
I tried to make a dynamic tree in python. It is simple and i have gotten it to work so far. I created a function in main that generates some example data for the tree and then the main goal was to ...
- 139
1
vote
0
answers
320
views
Quadtree implementation in Rust
To teach myself Rust, I implemented a simple Quadtree over 2D points with insert, delete, ...
- 11
11
votes
2
answers
9k
views
Recursive search on Node Tree with Linq and Queue
I've created a Node class which contains two important properties:
public Node Parent { get; private set; }
...
- 213
5
votes
1
answer
99
views
Unbalanced search tree for comparing multiple string arrays
I have a system that stores resources. A resource contains a string that represents a user role, for example "3".
With this user role "3", you can retrieve a list of permissions for the user role, ...
- 153
2
votes
1
answer
366
views
Implementation of Generic Binary Tree Code
I'm in the process of independently learning Generics as a way to build on a college assignment for Binary Search Tree. I've completed this program without Generics first and now I've converted over ...
- 23
0
votes
1
answer
80
views
Optimal BST challenge
I was coding the problem here. I think I have solved it, but I ran into time limit exceeded issues. I am new in Competitive Programming, so I was looking for a better, time efficient logic for solving ...
- 123
0
votes
1
answer
350
views
leetcode 987. Vertical Order Traversal of a Binary Tree
anyone can provide some suggestion about my answer for the questions
987. Vertical Order Traversal of a Binary Tree
Given a binary tree, return the vertical order traversal of its nodes values. ...
- 341
2
votes
1
answer
960
views
1
vote
1
answer
191
views
Maximum Width binary tree
Here is my code for the LeetCode problem
For a given binary tree, find the maximum width of the binary tree. The width of one level is defined as the length between the end-nodes even if there are <...
- 2,033
1
vote
1
answer
123
views
Inventory system codebase
I'm here looking for a review over my current code-base.
Please:
Ignore using namespace std; this is for educational purposes mostly so the usage of using namespace std; does not matter for this ...
- 91
3
votes
2
answers
1k
views
Geektrust: Modelling Family Relationships in a OO way
I'm trying to model family relationships in a OO way, i.e. As we update the relationships between two individuals our model must be able to find the people given a person and the type of relationship
...
- 1,148
3
votes
1
answer
570
views
An implementation of an AVL tree with unique_ptr
I've implemented an AVL tree using unique_ptr. The code has been stress-tested and there are no crashes or segmentation faults. I left the program running at night and stopped it manually the next ...
- 143
4
votes
1
answer
47
views
Convert an in-ordered and pre-ordered array to a BST
I am working on a Daily Coding Challenge to print the BST if given an in-ordered and pre-ordered array.
Below is my code in JavaScript ES6.
Please can you review it. This is my first fully-featured ...
- 2,033
3
votes
1
answer
194
views
Binary Search Tree to store objects now with improvements
Objective:
I'm trying to create a BST in order to insert Packet objects for search purposes. Packet holds information like partId, ...
- 91
2
votes
2
answers
1k
views
Binary Search Tree to store objects by object ID
I'm trying to create a binary search tree that would be used to insert my Packet objects'. It holds information like partId, ...
- 91
11
votes
3
answers
2k
views
Find the common ancestor between two nodes of a tree
Here is my code in Python for to find a common ancestor between two nodes in a particular tree. This is a question from Cracking the Coding Interview that I decided to implement on my own. No one has ...
- 213
8
votes
2
answers
2k
views
Word-Ladder solver in Python 3
Follow-up to Python program to find a word ladder transforming "four" to "five"
I'm trying to write a program to solve a word ladder puzzle to brush up on my Python. For those who ...
- 443
3
votes
1
answer
74
views
Haskell API for manipulating Tree/Forest
I'm experimenting how a Relation (a cartesian product's subset) can be implemented in Haskell using different data classes.
Forest and Tree allow to keeps together in a single data structure ...
- 273
2
votes
1
answer
75
views
Unique binary search trees
I have written some code that prints out all unique pre-ordered binary search trees containing numbers 1 to n.
It is not an ...
- 2,033
4
votes
2
answers
702
views
Find the in-order successor of a given node in a binary search tree
I have an implementation of an algorithm to return the in-order successor of a given node in a binary search tree. We are allowed to assume that each node in the BST has a reference to its parent node....
- 222
4
votes
1
answer
97
views
Building a tree in python
Please can someone confirm if this code is the best way to build the following tree
...
- 2,033
3
votes
1
answer
650
views
A BFS and DFS implementation
I believe this code prints both the DFS and BFS of a directed graph. As with some of my previous posts, this is mainly to share my code with other people working on a similar issue but I would also ...
- 2,033
3
votes
2
answers
204
views
LeetCode: Leaf-similar trees C#
Please comment about performance
https://leetcode.com/problems/leaf-similar-trees/
Consider all the leaves of a binary tree. From left to right order,
the values of those leaves form a leaf ...
- 5,311
1
vote
1
answer
785
views
AVL tree implementation using shared_ptr/unique_ptr
I have implemented an AVL tree using shared_ptr. I know that there is an overhead regarding using shared_ptr and instead a unique_ptr could be used. But the thing is that my node contains also a ...
- 143
2
votes
1
answer
161
views
Sequence for Pre-order traversal of Binary Trees
I wanted to make a Sequence that can do a pre-order traversal of Binary Tree. Doing so provides automatically unlocks wonderfully useful methods, like ...
- 494
1
vote
1
answer
451
views
Python program for Word Search II
This is a Leetcode problem -
Given a 2D board and a list of words from the dictionary, find all
words in the board.
Each word must be constructed from letters of a sequentially adjacent
...
- 2,468
3
votes
0
answers
292
views
reverse recursive search on an object with javascript - like tree search
I implemented a tree search with JavaScript.
It has below basic rules.
It will search over an array of objects which has recursive(like fractal)
If it found a according data in a leaf(the final ...
- 321
2
votes
1
answer
67
views
Removal of subtrees in tree on condition optimally
I have a small program that removes subtrees of a tree based on following condition: If a subtree consists only of nodes with "rank" 1, remove it. I am using recursive DFS approach. Trees or ...
- 21
-4
votes
1
answer
88
views
Finding the sublist with best utility function among all list's permutations [closed]
I try to find the the better solution in terms of time complexity.
Among the list of elements I need to find the sublist with maximum value of given utility function.
Each element has it's own type. ...
- 157
1
vote
1
answer
2k
views
Parse provided json, and in jObject find and convert all jToken.double types that have whole number value to long type [closed]
I wrote code sample below that is finding decimal values in jObject without '.' char, and convert them to long type. The issue is that it works for max jObject that contains two child jObjects.
...
- 11
2
votes
1
answer
338
views
Fibonacci sequence binary tree console logger
I wrote code to show the structure of a Fibonacci sequence pattern in a graphical way. First I structure a tree given a variable the user inputs for how many iterations of the sequence they want to ...
- 123
2
votes
2
answers
245
views
Leetcode: Flatten binary tree to linked list C#
https://leetcode.com/problems/flatten-binary-tree-to-linked-list/
Please comment on performance
Given a binary tree, flatten it to a linked list in-place.
For example, given the following ...
- 5,311
4
votes
3
answers
844
views
LeetCode: maximum-depth-of-n-ary-tree
https://leetcode.com/problems/maximum-depth-of-n-ary-tree/
Given a n-ary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the ...
- 5,311
4
votes
1
answer
84
views
Adding an item to a hierarchical data structure
What I need to do is create a new object, modify it using a recursive function, then merge it with another object, and do this all in such a way that the values of the new object take precedence over ...
- 41
1
vote
2
answers
429
views
Leetcode - find if BST is valid or not
Given a binary tree, determine if it is a valid binary search tree
(BST).
Assume a BST is defined as follows:
The left subtree of a node contains only nodes with keys less than the
node'...
- 749
4
votes
1
answer
9k
views
Convert nested array of values to a tree structure
I have a nested array that represents a parent child relationship, that I need to convert to a tree structure.
Example nested array
...
- 103
2
votes
2
answers
816
views
Find all k points which are closest to origin
We have a list of points on the plane. Find the K closest points to
the origin (0, 0).
(Here, the distance between two points on a plane is the Euclidean
distance.)
You may return the ...
- 749
3
votes
1
answer
616
views
C# Binary search tree
I implemented binary search tree. What do you think about my code? How could i optimize it? Where are my major mistakes? I am not asking only about BST but about my coding style in general, using of ...
- 51
4
votes
2
answers
122
views
Extract indices of visible nodes in a tree where only some nodes are expanded
A program that I work on constantly updates and modifies program state containing an arbitrarily deep and wide tree. The data looks something like this.
...
- 257
6
votes
1
answer
297
views
Rendering tree of nodes as string
I'm creating a debug-view for my expression-trees. They record each operation automatically in a tree that I am transforming into string so that I can see the exact ...
- 44k
1
vote
1
answer
51
views
Depth-first traversal implementation in Java (by recursion)
I implemented a recursive depth-first traversal, with all three traversal modes in this function. Is this the most succinct way to write the code?
...
- 325
1
vote
1
answer
141
views
Slow insertion into a Red Black tree
I am trying to implement a red black tree. The problem is that the code runs slowly and I wonder if I did something wrong or just did it too many times. I already checked and the problem is in the ...
- 19
3
votes
1
answer
2k
views
Implement BinarySearchTree class in python
I am currently study the basic data structure and trying to implement everything as I go. can anyone give me some feedback about class BinarySearchTree how to make the code more elegant. any review ...
- 341
5
votes
3
answers
727
views
Repeatedly keep removing 2 smallest elements and add its sum back to the list and return newly inserted elements' total
I have a list of unsorted numbers. Each time, I need to remove 2 smallest numbers and insert back its sum into the list. Repeatedly do this till the 1 final element is remaining in the list.
Return ...
- 151
5
votes
2
answers
104
views
A recursive solution to symmetirc tree
I tried to solve a symmetric tree problem
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree ...
- 585
6
votes
1
answer
338
views
Ternary Search Tree / N-Gram Model in Python
I implemented a word n-gram model using a character ternary search tree. It is intended to be passed a generator that yields a long sequence of words (from a corpus) and its requirements are that it
...
- 121
4
votes
1
answer
953
views
Walking over a N branching tree
The aim of this code, written in Python3.6, was to write a function that will non-recursively walk over a N-branching tree structure.
It works by using a list of indices that keep track of visited ...
- 841