Ekemini Thompsonekeminithompson.hashnode.dev·Nov 21, 2024Algorithms: Binary Search AlgorithmConcept:Binary Search is an efficient algorithm to find the position of a target element in a sorted array. It works by repeatedly dividing the search range in half. If the target is not found in the middle, it determines whether to search in the lef...Discussdata structures and algorithmAlgorithms Data Structures
Chetan Dattachetan77.hashnode.dev·Oct 27, 2024Diameter of Binary TreeProblem Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root. The length of a p...DiscussLeetcodediameter-of-binary-tree
Bonaventure OgetoforHojaLeaks Coding Tutorialshojaleaks.com·Oct 14, 2024Introduction to Binary Search Trees (BST) [2024] Guide | Day #13Binary Search Trees (BST) are one of the most fundamental data structures in computer science, widely used for organizing and retrieving data efficiently. In this guide, we will explore what a BST is, its properties, and how it supports operations li...Discuss·10 likesData Structures and AlgorithmsGeneral Programming
Rohit Gawanderohit253.hashnode.dev·Sep 29, 2024Chapter 27 :Binary Tress(Part 1)In this chapter, we dive deep into one of the most fundamental and essential data structures in computer science: Binary Trees (BT). Binary Trees are hierarchical structures that play a significant role in numerous algorithms and applications, includ...DiscussDSA(Data Structure and Algorithm) In JAVABinaryTrees
Jyotiprakash Mishrablog.jyotiprakash.org·Sep 25, 2024Introduction to TreesIn computer science, trees are a fundamental non-linear data structure composed of nodes connected by edges. A tree is a hierarchical model that represents a collection of elements, each of which can have a number of children but only one parent (exc...Discuss·2.0K readsTrees
Chetan Dattachetan77.hashnode.dev·Sep 23, 2024Height of a Binary Tree - Max DepthProblem Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. (link) Example 1: Input: root = [3,9,20,null,null,15,7]...DiscussLeetcodeHeight of a Binary Tree
Chetan Dattachetan77.hashnode.dev·Sep 22, 2024Implementing DFS Using a StackHere we illustrates the implementation of DFS iteratively using stacks. For the recursive implementation of DFS refere this article. Preorder Traversal Problem Given the root of a binary tree, return the preorder traversal of its nodes' values. (link...DiscussLeetcodeinorder
Chetan Dattachetan77.hashnode.dev·Sep 21, 2024Binary Trees | Types | BFS | DFSIntroduction Arrays and linked lists are flat structures, whereas a tree is a hierarchical structure. If a tree has only 2 children, then it is called a binary tree. Terminology Root: The head of the tree is called the root node. Leaf node: A n...DiscussLeetcodetraversals
Ayush Patidarayushpatidar.hashnode.dev·Sep 4, 2024Children Sum Property - Binary TreeProblem Statement: Given a Binary Tree, convert the value of its nodes to follow the Children Sum Property. The Children Sum Property in a binary tree states that for every node, the sum of its children's values (if they exist) should be equal to the...DiscussBinaryTrees
Namra Ajmaldatanerd.hashnode.dev·Aug 24, 2024Step-by-Step Guide to Binary Tree Implementation in C++What is a Binary tree? A binary tree is tree data structure in which each node can have at most two child nodes referred to as the left and right child. The two types of binary trees on which we are going to focus today are full and complete binary ...DiscussGeneral Programming