Movatterモバイル変換

Question 1

5votes

2answers

470views

Weakly-Referencing Tree Structure in Python

For another project of mine, I decided that it would be handy to have a tree structure to dictate hierarchy between pieces of data, but I didn't want to unnecessarily keep that data alive if it would ...

BetterBuiltFool

53

askedJul 13 at 15:52

Question 2

2votes

0answers

77views

Higher-order procedures for tree manipulation in SICP

I'm working my way through Structure and Interpretation of Computer Programs and got to exercises 2.27-2.28, reproduced here:Exercise 2.27. Modify your reverse procedure of exercise 2.18 toproduce ...

Luke

21

askedMar 4 at 19:29

Question 3

6votes

2answers

83views

STL style iterator template for arbitrary trees in C++20

In different code bases I regularly encounter tree data structures of different design and usually need to traverse it at some point. I finally got tired of writing yet another iterative traversal by ...

besc

163

askedOct 11, 2024 at 21:51

Question 4

2votes

1answer

103views

Numba implementation of AA Tree with rank and select operations

I've implemented an AA Tree (a type of self-balancing binary search tree) using Numba, a just-in-time compiler for Python. This implementation includes rank and select operations, which are useful for ...

Krosvick

21

askedAug 29, 2024 at 17:19

Question 5

7votes

3answers

785views

Optimal Algorithm to Append and Access Tree Data

I have been studying intermediate or more advanced data structures in Python, one of which I've decided to try out is the Tree Data Structure. I've been studying the theories as well as the ...

Raphael Irvin

177

askedAug 19, 2024 at 4:04

Question 6

5votes

1answer

134views

Fast and low Memory Requiring Lookup Tree Library

BackgroundWhile working on solving the end game of the russian card game Durak I developed a library small_memory_tree to store the simulation results. You can try the game on my website Modern Durak ...

Koronis Neilos

161

askedJul 3, 2024 at 8:59

Question 7

1vote

0answers

128views

Rust implementation of a BTree

I'm studying rust, and I decided to implement a BTree as a way of learning the language.Can anyone give me suggestions on the code?As the language has no inheritance, and we must replace it with ...

Lucas Paixão

174

askedMay 4, 2024 at 17:28

Question 8

5votes

1answer

145views

Making sklearn's decision trees easier to traverse

scikit-learn's decision tree structure is difficult for me to navigate. I would prefer to have functionality liketree.left, ...

Steven Gubkin

151

askedApr 6, 2024 at 5:18

Question 9

6votes

3answers

552views

Leetcode: Largest Number

I was trying out leetcode's Largest Number. As per the challenge's description:Given a list of non-negative integers nums, arrange them such thatthey form the largest number and return it. Since ...

ccot

351

askedApr 4, 2024 at 9:34

Question 10

2votes

2answers

704views

Binary tree deepcopy using the Morris traversal in C

I need to perform a deep copy of a binary tree using the Morris traversal.I think I managed to do it, that is the code below returns what I expect; however, I am not 100% sure I have covered every ...

Slav

121

askedMar 26, 2024 at 20:43

Question 11

2votes

3answers

178views

Maximum Sum BST in a Binary Tree

I was trying to find the Maximum sum BST of a binary tree on LeetCode. While the Java code I have come up with, mostly seems right and is able to pass 55 out of the given 59 test cases too, the error ...

Siddharth Garg

21

askedFeb 14, 2024 at 15:23

Question 12

8votes

3answers

1kviews

Simple tree dictionary structure in C

I have developed a C library whose goal is to store strings in an easily searchable tree structure (which I have dubbed tree-dictionary). I come from a math background and I have been coding in Python ...

francescoriccardocrescenzi

347

askedFeb 12, 2024 at 13:04

Question 13

2votes

1answer

108views

Semi-dynamic range minimum query (RMQ) tree in Java

IntroductionI have this semi-dynamic range minimum query (RMQ) tree in Java. It is called semi-dynamic due to the fact that it cannot be modified after it is constructed. However, the values ...

coderodde

32.3k

askedFeb 8, 2024 at 6:30

Question 14

3votes

0answers

67views

Assign unique identifiers to binary matrices using a binary tree

ContextI want to build a transposition table where the game states are binary square matrices which sizeMATRIX_SIZE is known at compile time. Rather than storing ...

Tristan Nemoz

175

askedNov 18, 2023 at 20:03

Question 15

4votes

1answer

95views

Hashing a fixed size binary stream with a tree structure in Rust

For a research project, I want to assign a unique identifier to a stream of bits. I can assume that all the streams will always have the same size.Because of this nice property, my idea has been to ...

Tristan Nemoz

175

askedNov 10, 2023 at 1:26

Movatterモバイル変換

Stack Exchange Network

Questions tagged [tree]

Weakly-Referencing Tree Structure in Python

Higher-order procedures for tree manipulation in SICP

STL style iterator template for arbitrary trees in C++20

Numba implementation of AA Tree with rank and select operations

Optimal Algorithm to Append and Access Tree Data

Fast and low Memory Requiring Lookup Tree Library

Rust implementation of a BTree

Making sklearn's decision trees easier to traverse

Leetcode: Largest Number

Binary tree deepcopy using the Morris traversal in C

Maximum Sum BST in a Binary Tree

Simple tree dictionary structure in C

Semi-dynamic range minimum query (RMQ) tree in Java

Assign unique identifiers to binary matrices using a binary tree

Hashing a fixed size binary stream with a tree structure in Rust

Hot Network Questions

Subscribe to RSS