Need a random map for your Rust game project? Np.
**knossos**: A Rust library / CLI for generating mazes.
Supports multiple algorithms & saving to a file!
GitHub: 
Recent searches
Search options
#BinaryTree
0 posts0 participants0 posts today
#OEIS
Оказывается, внутри #Collatz conjecture, прямо после десятки (10 -> 3 или 3 -> 10 как угодно) живёт https://oeis.org/A007283
Кто бы мог подумать...
Это бесконечная линия, которая никогда не ветвится:
1, 2, 4, 8, 16, 5, 10, 3, 6, 12, 24, 48, ...
Я думал, что получится чутка приплюснутое #BinaryTree
Но я не ожидал бесконечных стрел как у Леголаса.
oeis.orgA007283 - OEIS
так как сегодня день числа π aka #PiDay я стал на #JavaScript рисовать дерево из #Collatz conjecture
начать решил с небольших объёмов -- перебрать только лишь до 20_000
и в этом #BinaryTree вдруг заметил длиннющую линию, которая совсем не ветвится. Оказалось, это Collatz 16551:
16551, 49654, 24827, 74482, 37241, 111724, 55862, 27931, 83794, 41897, 125692, 62846, 31423, 94270, 47135, 141406, 70703, 212110, 106055, 318166, 159083, 477250, 238625, 715876, 357938, 178969, 536908, 268454, 134227, 402682, 201341, 604024, 302012, 151006, 75503, 226510, 113255, 339766, 169883, 509650, 254825, 764476, 382238, 191119, 573358, 286679, 860038, 430019, 1290058, 645029, 1935088, 967544, 483772, 241886, 120943, 362830, 181415, 544246, 272123, 816370, 408185, 1224556, 612278, 306139, 918418, 459209, 1377628, 688814, 344407, 1033222, 516611, 1549834, 774917, 2324752, 1162376, 581188, 290594, 145297, 435892, 217946, 108973, 326920, 163460, 81730, 40865, 122596, 61298, 30649, 91948, 45974, 22987, 68962, 34481, 103444, 51722, 25861, 77584, 38792, 19396, 9698, 4849, 14548, 7274, 3637, 10912, 5456, 2728, 1364, 682, 341, 1024, 512, 256, 128, 64, 32, 16, 8, 4, 2, 1
Конечно, если бы я взял больше данных, она начала ветвится бы до/после 19396.
Inverting a binary tree is a classic problem that teaches valuable lessons about tree traversal and recursion. This blog post explores different approaches, including recursive and iterative methods, and compares their strengths and weaknesses. Whether you're preparing for technical interviews or enhancing your algorithmic skills, understanding this problem is crucial. Dive in to strengthen your tree manipulation skills! 
Read more: https://fanyangmeng.blog/invert-binary-tree/ #BinaryTree #Algorithms
Fanyang Meng's Blog · 226. Invert Binary TreeMaster inverting a binary tree (LeetCode 226) with Python! Discover recursive & iterative methods (BFS/DFS), pre/post-order traversal strategies, and node-swapping logic. Perfect for coding interviews and algorithm mastery. Step-by-step solutions explained.
![class BinaryNode
attr_accessor :value, :parent, :left, :right
include Enumerable
def each(...) = each_breadth_first(...)
def initialize value, left = nil, right = nil
@value, @left, @right = value, left, right
children.each { it.parent = self }
end
def left? = (not left.nil?)
def right? = (not right.nil?)
def parent? = (not parent.nil?)
def root? = parent.nil?
def leaf? = (left.nil? and right.nil?)
def balanced? = (left? and right?)
def all_balanced? = all? { it.balanced? or it.leaf? }
def children = [left, right].compact
def ancestors = if root? then [] else parent.ancestors + [parent] end
def descendants = collect { it.children }.flatten
def depth = map { it.ancestors.size }.max + 1
def each_breadth_first(&block) = traverse :push, &block
def each_depth_first(&block) = traverse :unshift, &block
private def traverse method, &block
nodes = [self]
until nodes.empty?
current = nodes.shift
yield current
nodes.send(method, *current.children)
end
end
end](https://cdn.masto.host/rubysocial/media_attachments/files/113/999/156/392/441/217/original/aa14b29c29e46dc8.png "class BinaryNode
attr_accessor :value, :parent, :left, :right
include Enumerable
def each(...) = each_breadth_first(...)
def initialize value, left = nil, right = nil
@value, @left, @right = value, left, right
children.each { it.parent = self }
end
def left? = (not left.nil?)
def right? = (not right.nil?)
def parent? = (not parent.nil?)
def root? = parent.nil?
def leaf? = (left.nil? and right.nil?)
def balanced? = (left? and right?)
def all_balanced? = all? { it.balanced? or it.leaf? }
def children = [left, right].compact
def ancestors = if root? then [] else parent.ancestors + [parent] end
def descendants = collect { it.children }.flatten
def depth = map { it.ancestors.size }.max + 1
def each_breadth_first(&block) = traverse :push, &block
def each_depth_first(&block) = traverse :unshift, &block
private def traverse method, &block
nodes = [self]
until nodes.empty?
current = nodes.shift
yield current
nodes.send(method, *current.children)
end
end
end")
Another new sample photo - here's Leaf!! The final pin of the Earth Unit Line!
The clear enamel is a little overfilled here, but otherwise it's almost there! To get this pin, follow the Short Circuit pre-launch page here: https://www.backerkit.com/call_to_action/890fb8c7-209c-4f92-a691-c54f77a8da91/landing 
Binary Tree Diameter: Algorithm and Implementation Guide https://jsdevspace.substack.com/p/binary-tree-diameter-algorithm-and #javascript #algorithms #binarytree
Day 26/100: #Leetcode daily question
Question: 951. Flip Equivalent Binary Trees
Good binary tree question and I did see the approach but got good understanding of tree questions
Check out my #GitHub where I post all the daily streak 
questions and #LeetcodeContest 
solutions
My Leetcode Github: https://github.com/akshatsingh1718
Solution Link: https://github.com/akshatsingh1718/leetcode/tree/main/flipEquivalentBinaryTrees
GitHubakshatsingh1718 - Overview👨💻 SWE @ HCL Tech | 💡 Machine Learning & Generative AI Enthusiast | 🌐 Full Stack Developer | ✍️ Blogger & Content Creator - akshatsingh1718
Day 25/100: #Leetcode daily question
Question: 2641. Cousins in Binary Tree II
Easy binary tree question but I saw the solution, could be done without seeing it.
Check out my #GitHub where I post all the daily streak questions and #LeetcodeContest solutions
Solution Link: https://github.com/akshatsingh1718/leetcode/tree/main/cousinsinBinaryTreeII
My Leetcode Github: https://github.com/akshatsingh1718/leetcode
GitHubleetcode/cousinsinBinaryTreeII at main · akshatsingh1718/leetcodeContribute to akshatsingh1718/leetcode development by creating an account on GitHub.
Day 24/100: #Leetcode daily question
Question: 2583. Kth Largest Sum in a Binary Tree
Easy binary tree question
Check out my #GitHub where I post all the daily streak questions and #LeetcodeContest solutions
Solution Link: https://github.com/akshatsingh1718/leetcode/tree/main/kthLargestSuminaBinaryTree
My Leetcode Github: https://github.com/akshatsingh1718/leetcode
GitHubleetcode/kthLargestSuminaBinaryTree at main · akshatsingh1718/leetcodeContribute to akshatsingh1718/leetcode development by creating an account on GitHub.
Now (7pm ET Wed) watch https://youtu.be/B6ew819GVBI (FEEL FREE TO SUBSCRIBE TO YOUTUBE
@hajiaghayi
FOR FUTURE LESSONS) Lesson 18: Introduction to Algorithms by Mohammad Hajiaghayi:
#Trees #TreeStructures #SearchTrees #rootedtree #binarytree #dictionaryoperation #insert #delete
This year, 2022 marks the 60th anniversary of that fateful day in 1962 when a 24-year-old Donald Knuth started writing “The Art of Computer Programming.” Now approaching his 85th birthday, Knuth has become almost a legend in the world of computer programming — and he’s still writing additional volumes for his massive analysis of algorithms.
But every year, right around Christmas time, there’s another tradition. Knuth gives a special lecture “pitched at non-specialists” for a small audience at Stanford University (where Knuth is a professor emeritus) and a larger audience online.
Donald Knuth’s 2022 ‘Christmas Tree’ Lecture Is about Trees
https://thenewstack.io/donald-knuths-2022-christmas-tree-lecture-is-about-trees/
The New StackDonald Knuth's 2022 'Christmas Tree' Lecture Is about TreesThis year, 2022 marks the 60th anniversary of that fateful day in 1962 when a 24-year-old Donald Knuth started writing
This clip is a bit more peaceful than that chaotic-looking one that I posted a couple of days ago 
.
GIF
Continued thread
Some stuff that led to me thinking about a relationship between #PascalsTriangle and #binaryTrees.
It seems to have started with me trying to represent Pascal’s triangle using things like #crochet, #macrame, #braiding and #knitting.
Continued thread
A radial #binaryTree
Tweeted 4 year ago with this comment: “One thing that came out of this question is...a radial #binarytree. I think that @inversed_ru did something similar a while back in a different context. I may map this onto a cone, put it in a 3d modling program, intertwine branches...or...or...something #mathart #geometricart”. Note that the user name corresponds to Twitter, not Mastodon.
Continued thread
And another clip of a representation of a #PascalsTriangle #BinaryTree
GIF
Continued thread
Here is a clip to do with the #PascalsTriangle #BinaryTree shown as individual paths layered together
GIF
Continued thread
Continued thread
These ideas eventually worked their way into a #woven #BinaryTree representation of #PascalsTriangle.
Continued thread
