<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Sun, 05 Apr 2026 08:06:46 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/binarytree/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[DSA (Medium) - Binary Search Tree - Delete Node in a BST (Python, Typescript & Go)]]></title><description><![CDATA[Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST. Basically, the deletion can be divided into]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-search-tree-delete-node-in-a-bst-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-search-tree-delete-node-in-a-bst-python-typescript-and-go</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Fri, 04 Apr 2025 14:58:24 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRU8KXZiWSgA7KzZmV9Ldkz8tAzaVWSFwyhRn6jk8HXxjmxqzaA1wQMR5UVUTFFFfAs9C6R2cQg6DqL9s3otQ15jMxz2?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Easy) - Binary Search Tree - Search in a Binary Search Tree (Python, Typescript & Go)]]></title><description><![CDATA[You are given the root of a binary search tree (BST) and an integer val. Find the node in the BST that the node's value equals val and return the subtree rooted with that node. If such a node does not]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-easy-binary-search-tree-search-in-a-binary-search-tree</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-easy-binary-search-tree-search-in-a-binary-search-tree</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Thu, 03 Apr 2025 14:13:12 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTqYCXnGAvBxjUWa689oLEJ3oN5rHRK73EppVLoQMohRAFsZKZBHuM9CazXtE9pXStwQuj6LpgSoL4u99FGySkhCkmC?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) - Binary Tree - Binary Tree Right Side View (Typescript, Python & Rust)]]></title><description><![CDATA[Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 1: Input: root = [1,2,3,null,5,null,4]]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-tree-binary-tree-right-side-view</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-tree-binary-tree-right-side-view</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Tue, 01 Apr 2025 16:28:48 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTpeo1E8cY31muCD19qsJ6pjoeUQqN5Qf7sQKS1ybzhiRwJnsMyuesYgLcpCVnMoiFWsz1yAdgmZvwinYExs6uhkjj4?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Binary Tree Traversal:How to find Preorder,Inorder And Postorder.]]></title><description><![CDATA[Preorder: The root is visited first, followed by the left subtree in preorder, and finally the right subtree in preorder in this traversal. (RTlTr) Inorder: Before going to the root node, you'll go to]]></description><link>http://direct.ecency.com/hive-163521/@jazzbel1/binary-tree-traversal-how-to-find-preorder-inorder-and-postorder</link><guid isPermaLink="true">http://direct.ecency.com/hive-163521/@jazzbel1/binary-tree-traversal-how-to-find-preorder-inorder-and-postorder</guid><category><![CDATA[hive-163521]]></category><dc:creator><![CDATA[jazzbel1]]></dc:creator><pubDate>Wed, 27 Oct 2021 09:38:39 GMT</pubDate><enclosure url="https://images.ecency.com/p/PB8ro82ZpZP35bVGjGoE93K3E4U5KX8KtMBJ2rhDWxH1Fzub7d5GmaHKwZ6VPA8QkYS3kid2nFzJ19SHKkfCHJCJKT9P55jicEo6P94yY8zfWvYe?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Golang Programming Datastructure BinaryTree.]]></title><description><![CDATA[二叉树 树有很多种，每个节点最多只能有两个子节点的一种形式称为二叉树； 二叉树的前序遍历，中序遍历，后序遍历 树的常用术语： 根节点root 父节点 子节点 叶子节点：没有子节点的节点； package main import "fmt" type Hero struct { No int Name string Left *Hero Right *Hero }]]></description><link>http://direct.ecency.com/golang/@sslinux/golang-programming-datastructure-binarytree</link><guid isPermaLink="true">http://direct.ecency.com/golang/@sslinux/golang-programming-datastructure-binarytree</guid><category><![CDATA[golang]]></category><dc:creator><![CDATA[sslinux]]></dc:creator><pubDate>Wed, 02 Jan 2019 07:09:33 GMT</pubDate></item><item><title><![CDATA[Ruby Programming Tutorial - Lesson 32 - Recursion and Binary Trees]]></title><description><![CDATA[In this article we are going to learn about binary Tree data structure Before we go learn it, we should be familiar with Recursion, and recursive methods. so lets learn them first :) What is Recursion]]></description><link>http://direct.ecency.com/ruby/@bilal-haider/ruby-programming-tutorial-lesson-32-recursion-and-binary-trees</link><guid isPermaLink="true">http://direct.ecency.com/ruby/@bilal-haider/ruby-programming-tutorial-lesson-32-recursion-and-binary-trees</guid><category><![CDATA[ruby]]></category><dc:creator><![CDATA[bilal-haider]]></dc:creator><pubDate>Thu, 22 Mar 2018 10:28:00 GMT</pubDate><enclosure url="https://images.ecency.com/p/7258xSVeJbKnFEnBwjKLhL15SoynbgJKpQxRd1uowotvBUizsh4BWgjgC2fejxLU6dhLX6JE5LwKajvjr9xTTS6d47e8v7hSHa61XxXzE22eNgAXzgeDWGKDRZBoos4P9iei4XabbPngn?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>