Questions tagged [binary-tree]
The binary-tree tag has no usage guidance.
37
questions
0
votes
0
answers
49
views
Is this iterative inorder traversal algorithm well-known?
I was concerned about the approach in Morris traversal algorithm and came up with simpler solution that uses parent pointers in nodes.
The constraints were following:
Time Complexity: O(n)
Space ...
- 1
5
votes
1
answer
83
views
leetcode 530. In-order traversal of a binary search tree (C++17)
Given a binary search tree, the problem requires calculating the minimum absolute difference between any two keys in the tree. Given the binary search property, the minimum difference must be between ...
- 153
3
votes
3
answers
919
views
A toy implementation of binary tree
I'm playing around with a toy implementation of binary trees in C.
I have a typedef'd struct BTree like so —
...
- 135
14
votes
4
answers
3k
views
Max-heap implementation in C
I have tried to implement my Heap in C. The following are the 13 operations defined:
build_maxheap
insert
exctract_max (delete heap max root)
max_delete (delete an element or key)
max_heapify
clear
...
- 525
0
votes
0
answers
36
views
Procedurally generated 2D grid module implemented in Rust
I've got this Rust module which implements a procedurally-generated module that operates on a 2D grid (implemented as a vector of vectors). However, I'm not sure if its idiomatic Rust or how efficient ...
- 145
1
vote
1
answer
96
views
'Learning' Animal Guesser Program
I've written a program that uses a binary tree to essentially 'learn' about animals given the name and questions about them. Learn is probably a little strong of a word, all it does is store the ...
- 13
1
vote
1
answer
126
views
Binary space partition implemented in Rust which operates on a 2D vector
So I have this binary spaced partition leaf:
...
- 145
2
votes
2
answers
251
views
Binary Expression Tree that evaluates Postfix input
My code for a Binary Expression Tree that takes postfix input from the user and recursively builds and evaluates the expression. Proper input can be assumed.
...
- 837
2
votes
1
answer
150
views
Lowest Common Ancestor of a Binary Tree in Rust
I am trying to solve the lowest common ancestor problem in Rust. It is guaranteed that the id's of the tree are unique. It is also guaranteed that the two nodes which we are looking for in the tree ...
4
votes
1
answer
2k
views
Create and view a family tree
I have an assignment due Friday to make a family tree. Started to code in January. My reviews from the teacher for this code was that the use of pointers was horrendous and it wasn't OOP enough. This ...
- 43
3
votes
1
answer
378
views
Huffman coding implementation in java
I wrote a simple huffman coding algorithm for learning and practice. I just used the technique given on the wikipedia page.
Could you tell me my missing points and mistakes?
Node.java
...
- 33
2
votes
2
answers
175
views
C library implementing binary trees
This is my first attempt at writing a library in C. I have only included tree creation and in-order traversal function for now, but will expand to have more functions soon. I have three files, ...
- 111
2
votes
1
answer
150
views
Leetcode 662: maximum width of binary tree in Java
I have the following solution to this problem. The idea is to compute the maximum width of a binary search tree. The width of a BST on a particular depth is defined as the distance from the leftmost ...
- 27k
1
vote
1
answer
136
views
Binary Tree Level-Wise Creation and Traversal
I have used a queue, which has been implemented using a singly linked list, to facilitate the level-wise creation and traversal of the binary tree.
...
- 311
1
vote
1
answer
191
views
Sink algorithm in Max Heap Correctness
I am trying to determine the correctness of a helper method within my MaxHeap class.
The goal of this helper method is, given the index of any node in the Max Heap, sink it to the correct level in the ...
- 41
2
votes
1
answer
114
views
Find ALL duplicate subtrees. using recursion
This is just a practice exercise, I'm trying to understand dynamic programming as deeply as I can. I solved this using recursion, though I am not sure if it will always work. If anyone could tell me a ...
- 121
1
vote
1
answer
137
views
Patricia tree implementation in Rust
I've implemented a map using a Patricia tree, using u64 as keys.
I would like general feedback on my code, but I have one thing that I think could be implemented in ...
- 615
2
votes
0
answers
92
views
Deserialize a binary breadth-first in functional programming
A while back, I answered this question on Stack Overflow that involved deserializing a binary tree breadth-first using functional programming (the question itself isn't relevant). I'd like to make ...
- 499
3
votes
1
answer
100
views
AVL Tree in C Criticism
I have made an AVL tree in C and coded the basic functionality of insertion, deletion, and search. I would love some criticism on my implementation especially on the insertion and deletion section of ...
- 413
1
vote
2
answers
128
views
How can I optimize this Binary Search Tree?
I've added some methods to a basic BST implementation for integers - if anyone can point out some ways that this could be written in a more efficient or clean manner, please let me know.
...
2
votes
1
answer
187
views
Implementation of binary tree traversal
Based on what i understood of Binary Tree, queue and recursion I implemented this Breadth First Search algorithm as follows.
Do you have any suggestions to improve (in term of readability, good ...
- 293
1
vote
2
answers
185
views
Find Binary Tree Path Sum
I am trying to resolve following problem. Please advice which part of the code can be improved.
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the ...
2
votes
2
answers
169
views
Lowest Common Ancestor in Binary Tree (Iterative)
In the below code I've implemented a method to find the lowest common ancestor of a binary tree.
This is an iterative approach using this pseudocode.
Please suggest any improvements that can be made.
<...
- 435
2
votes
1
answer
121
views
HackerRank - Binary tree to compute the Nth power of natural numbers that sum up to X
I'm trying to solve this challenge on HackerRank.
In short, given x and n, I have to determine how many ways I can pick numbers ...
- 547
5
votes
0
answers
136
views
Binary PATRICiA Prefix Trie
I was wondering if we could speed-up lookup in a hash table of strings by only storing the difference between them, like HAMT. Taking this idea to its end, I ended up with a binary PATRICiA prefix-...
- 1,050
1
vote
1
answer
206
views
Best way to store the sum of all node depths?
To sum up all the nodes' depths in any given binary tree, I've written the following recursive algorithm:
...
4
votes
1
answer
128
views
AVL Tree implementation Based on VisualGo
I have tried implementing an AVL Tree on my own, based on visualising it. But i'm unsure how many testcases it work with, and how efficient it is. Are there any ways to make it efficient, and compact?
...
- 1,204
0
votes
1
answer
397
views
C++ Random Tree Node
I've been trying to kind of teach myself "Modern C++" the last couple of months and I just finished this interview type problem and thought it would be a good one to get some feedback on. I not ...
- 585
1
vote
2
answers
257
views
Leetcode: Cousins in Binary Tree
Mu solution to Leetcode problem Cousins in Binary Tree works, but the code feels bulky. Is there a better way to solve this problem, particularly to use less additional variables? I will appreciate ...
- 313
3
votes
2
answers
433
views
C word frequency counter
I write this program based on the algorithm of the word frequency counter program on the K&R book, page 139. I added some idioms of mine, some command-line options, and a dynamically allocable ...
- 864
3
votes
2
answers
335
views
LeetCode: Deepest Leaves Sum C#
Given a binary tree, return the sum of values of its deepest leaves.
Constraints:
The number of nodes in the tree is between 1 and 10^4. The value of
nodes is between 1 and 100.
...
- 5,321
3
votes
1
answer
41
views
I need to know that if everything okay in my BTS put and get method
I implement BinaryTree (K extends Comparable, V) concept to binarySearchTree and I have written get and put method. As far as I check, there is no problem in my code. So now I wonder that are there ...
1
vote
2
answers
2k
views
Binary Search Tree in c++ used to count words in a text
I just created a BinarySeachTree class in c++ which is supposed to store words read from a txt and the number of occurances of those words and i would just like some feedback from you. I think it ...
- 13
2
votes
1
answer
2k
views
Simple BST implementation using C++ Struct
I am trying to implement DSs in C++ and this is BST insert and search functions. I tried in two different ways, please review and see if one is advantageous over other.
With pointer to pointer
...
- 145
3
votes
2
answers
966
views
Simple Binary Search Tree Class with Insert and Search Functions
I am trying to learn to implement DSs in C++ and here is a simple implementation. Please review in terms of optimization, memory management, coding standards, etc
...
- 145
3
votes
1
answer
163
views
LeetCode: Most Frequent Subtree Sum
My solution to LeetCode problem Most Frequent Subtree Sum works, but I have several questions regarding the code. I am also looking for an advice on how to improve the code.
Problem:
Given the ...
- 313
3
votes
1
answer
376
views
Leetcode: Subtree of Another Tree
My solution to the LeetCode's Subtree of Another Tree passes all the test cases, but the code feels and looks ugly. Would appreciate an advice on how to improve it.
The problem:
Given two non-...
- 313